perm filename F84.IN[LET,JMC]1 blob
sn#781387 filedate 1984-12-31 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00766 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00081 00002 ∂01-Oct-84 0036 dsouza%hplabs.csnet@csnet-relay.arpa CS206 questions
C00085 00003 ∂01-Oct-84 0618 ATP.BLEDSOE@UTEXAS-20.ARPA [John McCarthy <JMC@SU-AI.ARPA>: promoting basic research in AI ]
C00089 00004 ∂01-Oct-84 0800 JMC*
C00090 00005 ∂01-Oct-84 0904 DIKRAN@SU-CSLI.ARPA
C00091 00006 ∂01-Oct-84 1000 JMC*
C00092 00007 ∂01-Oct-84 1022 oliger@Navajo Re: Visit to Denelcor
C00094 00008 ∂01-Oct-84 1029 ME 1985.xgp
C00095 00009 ∂01-Oct-84 1051 GOLUB@SU-SCORE.ARPA Vote
C00096 00010 ∂01-Oct-84 1155 MOGUL@SU-SCORE.ARPA re: PARC Forum on Thermonuclear Danger (from SAIL's BBOARD)
C00099 00011 ∂01-Oct-84 1312 TREITEL@SUMEX-AIM.ARPA re: PARC Forum on Thermonuclear Danger (from SAIL's BBOARD)
C00101 00012 ∂01-Oct-84 1347 RA
C00102 00013 ∂01-Oct-84 1350 RA
C00103 00014 ∂01-Oct-84 1512 CLT logic mailing list
C00105 00015 ∂01-Oct-84 1625 Mailer failed mail returned
C00106 00016 ∂02-Oct-84 0134 Spencer.PA@Xerox.ARPA Kurzweil Machine
C00109 00017 ∂02-Oct-84 0639 @SU-SCORE.ARPA:BHAYES-ROTH@SUMEX-AIM.ARPA common sense
C00111 00018 ∂02-Oct-84 0923 CLT cafe
C00112 00019 ∂02-Oct-84 0902 RTC A CS206 Student writes
C00113 00020 ∂02-Oct-84 1009 STEELE@TL-20A.ARPA Quintus
C00115 00021 ∂02-Oct-84 1033 DFH
C00116 00022 ∂02-Oct-84 1121 DFH Speaker at today's luncheon
C00117 00023 ∂02-Oct-84 1144 JMC*
C00118 00024 ∂02-Oct-84 1415 Allen.PA@Xerox.ARPA Re: Kurzweil
C00119 00025 ∂02-Oct-84 1511 @SRI-CSL:OPPENHEIMER@SRI-CSL.ARPA Oppenheimer resume
C00130 00026 ∂02-Oct-84 1515 WASOW@SU-CSLI.ARPA NSF & university-industry collaboration
C00133 00027 ∂02-Oct-84 1516 RA Reminder
C00134 00028 ∂02-Oct-84 2306 MA Re: Abadi
C00135 00029 ∂03-Oct-84 1007 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
C00137 00030 ∂03-Oct-84 1055 RA
C00138 00031 ∂03-Oct-84 1107 AAAI-OFFICE@SUMEX-AIM.ARPA Multilevel expert system workshop
C00140 00032 ∂03-Oct-84 1205 BLOCK@SU-CSLI.ARPA
C00141 00033 ∂03-Oct-84 1348 RA
C00142 00034 ∂03-Oct-84 1549 RA
C00143 00035 ∂03-Oct-84 1608 KAHN@USC-ISI.ARPA Re: update on hep
C00145 00036 ∂03-Oct-84 1813 MOGUL@SU-SCORE.ARPA Student reps to facilities committee
C00146 00037 ∂03-Oct-84 2132 BARWISE@SU-CSLI.ARPA The In-house Seminar
C00149 00038 ∂03-Oct-84 2205 ARK Scherlis
C00150 00039 ∂04-Oct-84 0414 @MIT-MC:rwg@SPA-NIMBUS Chudnovskys
C00153 00040 ∂04-Oct-84 0416 @MIT-MC:rwg%SPA-NIMBUS@SCRC-STONY-BROOK [CWH at SCRC-TENEX: Macsyma in NYC]
C00156 00041 ∂04-Oct-84 0822 BARWISE@SU-CSLI.ARPA Talk
C00158 00042 ∂04-Oct-84 1042 cheriton@Pescadero Thoughts on HEP
C00170 00043 ∂04-Oct-84 1059 ARK Scherlis
C00171 00044 ∂04-Oct-84 1122 WITHGOTT@SU-CSLI.ARPA Talk on the 25th?
C00173 00045 ∂04-Oct-84 1150 WITHGOTT@SU-CSLI.ARPA
C00174 00046 ∂04-Oct-84 1358 RA
C00175 00047 ∂04-Oct-84 1446 RA
C00176 00048 ∂04-Oct-84 1529 ucscc!beeson%ucscg.ucscc.UUCP@Berkeley thanks
C00181 00049 ∂04-Oct-84 1530 RA interview
C00182 00050 ∂05-Oct-84 0013 RPG
C00183 00051 ∂05-Oct-84 1017 RA Gordon Bell
C00184 00052 ∂05-Oct-84 1225 RTC Common Lisp at Hewlett Packard
C00185 00053 ∂05-Oct-84 1253 RTC CS206 class size
C00186 00054 ∂05-Oct-84 1324 JDM Key to offices containing lisp machines
C00187 00055 ∂05-Oct-84 1346 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Announcing a new seminar.
C00191 00056 ∂05-Oct-84 1535 RA interview for Christian Science Radio
C00192 00057 ∂05-Oct-84 1542 RA Did you reorder the textbook for CS206?
C00193 00058 ∂05-Oct-84 2122 ME Prancing Pony Bill
C00197 00059 ∂05-Oct-84 2241 cheriton@Pescadero HEP Doc.
C00199 00060 ∂06-Oct-84 0900 JMC*
C00200 00061 ∂06-Oct-84 1050 JJW HEP
C00202 00062 ∂06-Oct-84 2328 SMC vet school narrative
C00203 00063 ∂07-Oct-84 1536 FEIGENBAUM@SUMEX-AIM.ARPA Re: Gordon Bell
C00204 00064 ∂07-Oct-84 1721 GOLUB@SU-SCORE.ARPA [John McCarthy <JMC@SU-AI.ARPA>: Gordon Bell ]
C00206 00065 ∂07-Oct-84 2000 ullman@diablo Bell talk
C00207 00066 ∂07-Oct-84 2002 GOLUB@SU-SCORE.ARPA
C00208 00067 ∂07-Oct-84 2006 BOSACK@SU-SCORE.ARPA Re: Gordon Bell
C00209 00068 ∂07-Oct-84 2013 GOLUB@SU-SCORE.ARPA
C00210 00069 ∂07-Oct-84 2016 cheriton@Pescadero Re: HEP
C00213 00070 ∂07-Oct-84 2022 cheriton@Pescadero Re: Gordon Bell
C00214 00071 ∂07-Oct-84 2152 MS modems
C00217 00072 ∂07-Oct-84 2230 GENESERETH@SUMEX-AIM.ARPA
C00218 00073 ∂07-Oct-84 2318 MS DM terminal
C00220 00074 ∂08-Oct-84 0800 JMC*
C00221 00075 ∂08-Oct-84 0841 NILSSON@SRI-AI.ARPA Re: needed example
C00223 00076 ∂08-Oct-84 0851 NILSSON@SRI-AI.ARPA Re: preliminary remarks on your non-monotonic chapter
C00225 00077 ∂08-Oct-84 0854 Spencer.PA@Xerox.ARPA Change of Plans for Kurzweil
C00226 00078 ∂08-Oct-84 1039 RA
C00227 00079 ∂08-Oct-84 1057 MOGUL@SU-SCORE.ARPA Re: Subject: Zschau and Carnoy debate: Nuclear Weapons and National Security (from SAIL's BBOARD)
C00229 00080 ∂08-Oct-84 1130 RA reply to message
C00230 00081 ∂08-Oct-84 1136 RPG
C00231 00082 ∂08-Oct-84 1230 minker@maryland LOGIC AND AI WEEK ABSTRACTS
C00248 00083 ∂08-Oct-84 1233 RA file aaai.spe
C00249 00084 ∂08-Oct-84 1338 SMC narrative
C00250 00085 ∂08-Oct-84 1711 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 meeting
C00253 00086 ∂09-Oct-84 0800 JMC*
C00254 00087 ∂09-Oct-84 1007 RA renaming aaai.spe
C00255 00088 ∂09-Oct-84 1034 RA
C00256 00089 ∂09-Oct-84 1043 RA Interview with Bill Rus MGM
C00257 00090 ∂09-Oct-84 1110 RA
C00258 00091 ∂09-Oct-84 1330 RA
C00259 00092 ∂09-Oct-84 1332 JJW Denelcor
C00260 00093 ∂09-Oct-84 1342 minker@maryland Directions
C00266 00094 ∂09-Oct-84 1432 JJW 206
C00267 00095 ∂09-Oct-84 1643 RA
C00268 00096 ∂09-Oct-84 2229 cheriton@Pescadero Encore machine
C00272 00097 ∂10-Oct-84 0451 BARWISE@SU-CSLI.ARPA Wednesday Tea
C00273 00098 ∂10-Oct-84 0900 JMC*
C00274 00099 ∂10-Oct-84 0914 JJW Comments on your comments
C00278 00100 ∂10-Oct-84 0959 RA presentation at CIS sponsors meeting
C00279 00101 ∂10-Oct-84 1003 BERG@SU-SCORE.ARPA textbooks for CS206
C00280 00102 ∂10-Oct-84 1003 RA David Chudnovsky
C00281 00103 ∂10-Oct-84 1023 JJW Test code for the HEP
C00285 00104 ∂10-Oct-84 1044 SARASWAT@CMU-CS-C.ARPA Circumscription paper
C00287 00105 ∂10-Oct-84 1155 RA David Chudnovsky
C00288 00106 ∂10-Oct-84 1202 RA
C00289 00107 ∂10-Oct-84 1407 HANRAHAN@SU-SCORE.ARPA message
C00290 00108 ∂10-Oct-84 1450 RA
C00291 00109 ∂10-Oct-84 1540 RPG
C00293 00110 ∂10-Oct-84 1711 JJW@S1-A.ARPA HEP etc.
C00295 00111 ∂10-Oct-84 2008 LUNDSTROM@SU-SIERRA.ARPA CIS Annual Review
C00297 00112 ∂11-Oct-84 0200 SMC common.tex
C00298 00113 ∂11-Oct-84 0911 RPG
C00300 00114 ∂11-Oct-84 1331 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
C00302 00115 ∂11-Oct-84 1426 RA
C00303 00116 ∂11-Oct-84 1505 RA
C00304 00117 ∂11-Oct-84 1548 JJW Discussion
C00305 00118 ∂11-Oct-84 1620 PMF@S1-A.ARPA Discussion
C00307 00119 ∂11-Oct-84 1746 JJW Multiprocessor comparison
C00308 00120 ∂11-Oct-84 1748 JJW HEP Lisp
C00309 00121 ∂11-Oct-84 1923 JMC Farmwald comments
C00310 00122 ∂11-Oct-84 2248 BRESNAN@SU-CSLI.ARPA NL2 activities this quarter
C00316 00123 ∂11-Oct-84 2331 FEIGENBAUM@SUMEX-AIM.ARPA Re: Farmwald comments
C00317 00124 ∂12-Oct-84 0849 CHEADLE@SU-SCORE.ARPA Russell Greiner's Oral
C00319 00125 ∂12-Oct-84 0931 ullman@diablo Re: Farmwald comments
C00320 00126 ∂12-Oct-84 1008 HULLMAN@SU-SCORE.ARPA annual report
C00321 00127 ∂12-Oct-84 1106 HULLMAN@SU-SCORE.ARPA report
C00323 00128 ∂12-Oct-84 1135 @SU-SCORE.ARPA:ullman@diablo Tuesday Lunch
C00324 00129 ∂12-Oct-84 1143 RA
C00325 00130 ∂12-Oct-84 1333 LIBRARY@SU-SCORE.ARPA New Chess Books in the Math/CS Library
C00327 00131 ∂12-Oct-84 1339 RPG Meeting
C00328 00132 ∂12-Oct-84 1348 LIBRARY@SU-SCORE.ARPA New C Titles in the Math/CS Library
C00329 00133 ∂12-Oct-84 1401 LIBRARY@SU-SCORE.ARPA New Books in the Math/CS Library
C00331 00134 ∂12-Oct-84 1429 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
C00333 00135 ∂12-Oct-84 1439 AAAI-OFFICE@SUMEX-AIM.ARPA new scientist interview
C00335 00136 ∂12-Oct-84 1558 GENESERETH@SUMEX-AIM.ARPA Re: electronic library
C00336 00137 ∂12-Oct-84 1657 HANRAHAN@SU-SCORE.ARPA phone
C00337 00138 ∂12-Oct-84 1716 CLT
C00338 00139 ∂12-Oct-84 1804 PB picking up sail costs
C00339 00140 ∂12-Oct-84 2128 GLB
C00340 00141 ∂14-Oct-84 2152 @MIT-MC:rwg%SPA-NIMBUS@SCRC-STONY-BROOK [H at SCRC-STONY-BROOK: [asb at SCRC-CUPID: [rwg at SPA-NIMBUS: Chudnovskys]]]
C00345 00142 ∂15-Oct-84 0900 JMC*
C00346 00143 ∂15-Oct-84 0942 BERG@SU-SCORE.ARPA textbooks
C00347 00144 ∂15-Oct-84 0945 SF@SU-CSLI.ARPA clt reading committee
C00349 00145 ∂15-Oct-84 0955 SF@SU-CSLI.ARPA reading comm.
C00350 00146 ∂15-Oct-84 0958 CLT time for oral exam
C00351 00147 ∂15-Oct-84 1010 HANRAHAN@SU-SCORE.ARPA
C00352 00148 ∂15-Oct-84 1016 RA
C00353 00149 ∂15-Oct-84 1018 RA
C00354 00150 ∂15-Oct-84 1204 JF@SU-SCORE.ARPA TGIF will happen!!
C00355 00151 ∂15-Oct-84 1345 JF@SU-SCORE.ARPA when and where is t.g.i.f.?
C00356 00152 ∂15-Oct-84 1403 RA
C00357 00153 ∂15-Oct-84 1404 RA your CV
C00358 00154 ∂15-Oct-84 1507 RA
C00359 00155 ∂15-Oct-84 1618 RA
C00360 00156 ∂15-Oct-84 1923 CLT
C00361 00157 ∂15-Oct-84 2102 JJW 206
C00362 00158 ∂15-Oct-84 2138 FY I should be brandished.
C00363 00159 ∂15-Oct-84 2310 @SU-SCORE.ARPA:ARK@SU-AI.ARPA Re: when and where is t.g.i.f.?
C00365 00160 ∂15-Oct-84 2311 chou@UCLA-LOCUS.ARPA Papers on Circumscription
C00367 00161 ∂15-Oct-84 2314 JF@SU-SCORE.ARPA Re: when and where is t.g.i.f.?
C00368 00162 ∂16-Oct-84 0000 ARK sorry
C00369 00163 ∂16-Oct-84 1041 LIBRARY@SU-SCORE.ARPA Numerical Algorithms Group Documentation
C00370 00164 ∂16-Oct-84 1044 RA III 10/25 meeting
C00371 00165 ∂16-Oct-84 1045 RA
C00372 00166 ∂16-Oct-84 1059 withgott.pa@Xerox.ARPA 11/15
C00374 00167 ∂16-Oct-84 1129 @SU-SCORE.ARPA:KARP@SUMEX-AIM.ARPA TGIF
C00376 00168 ∂16-Oct-84 1155 JMC*
C00377 00169 ∂16-Oct-84 1258 fateman%ucbdali@Berkeley a contact regarding the HEP
C00379 00170 ∂16-Oct-84 1347 RA
C00380 00171 ∂16-Oct-84 1428 KARP@SUMEX-AIM.ARPA
C00381 00172 ∂16-Oct-84 1444 SMC funds
C00382 00173 ∂16-Oct-84 1500 JMC*
C00383 00174 ∂16-Oct-84 1720 @SU-SCORE.ARPA:WIEDERHOLD@SUMEX-AIM.ARPA Winter Quarter CSD Colloquium
C00385 00175 ∂17-Oct-84 0759 BMOORE@SRI-AI.ARPA
C00386 00176 ∂17-Oct-84 1407 BARWISE@SU-CSLI.ARPA Come on, guys
C00388 00177 ∂17-Oct-84 1648 HOBBS@SRI-AI.ARPA Discussant
C00389 00178 ∂17-Oct-84 1738 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
C00391 00179 ∂17-Oct-84 2341 COHN@SU-SCORE.ARPA photos are UP!
C00394 00180 ∂18-Oct-84 0655 BARWISE@SU-CSLI.ARPA NSF
C00396 00181 ∂18-Oct-84 1940 YM PhD Orals
C00397 00182 ∂18-Oct-84 2114 BRESNAN@SU-CSLI.ARPA Re: Come on, guys
C00399 00183 ∂18-Oct-84 2125 BRESNAN@SU-CSLI.ARPA [ishikawa.pa@XEROX.ARPA: Re: [Stanley Peters <PETERS@SU-CSLI.ARPA>: ICOT interest in]
C00403 00184 ∂19-Oct-84 0047 LLW@S1-A.ARPA Items
C00404 00185 ∂19-Oct-84 0843 AAAI-OFFICE@SUMEX-AIM.ARPA Re: electronic library
C00406 00186 ∂19-Oct-84 0845 TAJNAI@SU-SCORE.ARPA IBM Reception
C00407 00187 ∂19-Oct-84 0846 AAAI-OFFICE@SUMEX-AIM.ARPA Cross's proposal
C00408 00188 ∂19-Oct-84 0921 LIBRARY@SU-SCORE.ARPA Availabilty of Socrates Accounts When You Have Need for One
C00412 00189 ∂19-Oct-84 0926 CLT money
C00414 00190 ∂19-Oct-84 0952 TW AI specialization in CS masters program
C00417 00191 ∂19-Oct-84 1036 HADDAD@SU-SCORE.ARPA TGIF indoors
C00418 00192 ∂19-Oct-84 1036 RA dinner & reception at Hoover, Friday 11/02.
C00419 00193 ∂19-Oct-84 1051 RA you trip to UC Davis
C00420 00194 ∂19-Oct-84 1501 JJW Sequoia systems
C00423 00195 ∂19-Oct-84 1519 HADDAD@SU-SCORE.ARPA TGIF - correction
C00425 00196 ∂20-Oct-84 1007 LIBRARY@SU-SCORE.ARPA Services by E-mail from the Math/Computer Science Library
C00432 00197 ∂20-Oct-84 2031 ATP.BLEDSOE@UTEXAS-20.ARPA Re: Cross's proposal
C00434 00198 ∂20-Oct-84 2035 ATP.BLEDSOE@UTEXAS-20.ARPA [AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>: Cross's proposal]
C00438 00199 ∂20-Oct-84 2136 GOLUB@SU-SCORE.ARPA congratulations
C00440 00200 ∂21-Oct-84 1117 SHAWN@SU-SCORE.ARPA AI track in MS--please respond!
C00441 00201 ∂22-Oct-84 0919 FEIGENBAUM@SUMEX-AIM.ARPA [Bruce Delagi <DELAGI@SUMEX-AIM.ARPA>: [Andy Freeman <FREEMAN@SUMEX-AIM.ARPA>: [Glenn Adams <glenn@ll-xn.ARPA>: Re:
C00449 00202 ∂22-Oct-84 1112 RA Expo 85 seminar
C00450 00203 ∂22-Oct-84 1253 RESTIVO@SU-SCORE.ARPA
C00451 00204 ∂22-Oct-84 1420 JDM 3600 in RPG's office
C00452 00205 ∂22-Oct-84 1437 @SU-SCORE.ARPA:ullman@diablo Parallel Computation Center
C00455 00206 ∂22-Oct-84 1733 @SU-CSLI.ARPA,@SU-SCORE.ARPA:BMOORE@SRI-AI.ARPA [Bob Moore <BMOORE@SRI-AI.ARPA>: next F4 meeting]
C00458 00207 ∂23-Oct-84 0910 CHEADLE@SU-SCORE.ARPA University grading policies
C00460 00208 ∂23-Oct-84 0916 BARWISE@SU-CSLI.ARPA Wednesday's Tea
C00462 00209 ∂23-Oct-84 1127 TAJNAI@SU-SCORE.ARPA [Brent Hailpern <BTH.YKTVMX%ibm-sj.csnet@csnet-relay.arpa>: wine and cheese]
C00465 00210 ∂24-Oct-84 0918 MDIXON@SU-CSLI.ARPA lisp programming & proving typo
C00466 00211 ∂24-Oct-84 1143 BMOORE@SRI-AI.ARPA research activities
C00470 00212 ∂24-Oct-84 1149 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
C00471 00213 ∂24-Oct-84 1403 FISHER@SU-SCORE.ARPA Dean's Award for Services
C00475 00214 ∂24-Oct-84 1505 CC.CLIVE@UTEXAS-20.ARPA 36-Bit 20th Anniversary Events
C00480 00215 ∂24-Oct-84 1531 @SU-SCORE.ARPA:HOBBS@SRI-AI.ARPA Ignore previous message
C00482 00216 ∂24-Oct-84 1653 PYLYSHYN@CMU-CS-C.ARPA Ms on the Frame Problem
C00484 00217 ∂24-Oct-84 1855 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
C00486 00218 ∂24-Oct-84 2047 SMC car
C00487 00219 ∂25-Oct-84 0138 DAVIES@SUMEX-AIM.ARPA QLambda Progress report
C00492 00220 ∂25-Oct-84 1038 RA Invitation to give a talk
C00493 00221 ∂25-Oct-84 1119 JJW Information on Sequoia
C00495 00222 ∂25-Oct-84 1431 LIBRARY@SU-SCORE.ARPA Go, Chess, Poker--New Books in the Math/CS Library
C00497 00223 ∂25-Oct-84 1442 LIBRARY@SU-SCORE.ARPA New Books Math/CS Library
C00499 00224 ∂25-Oct-84 1734 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA postdoc announcements
C00502 00225 ∂26-Oct-84 1034 RA
C00503 00226 ∂26-Oct-84 1426 SCHAFFER@SU-SCORE.ARPA High-TeX Mail Forwarding Stickers
C00506 00227 ∂28-Oct-84 1811 RTC Disk Space
C00507 00228 ∂28-Oct-84 2348 @SU-SCORE.ARPA:WIEDERHOLD@SUMEX-AIM.ARPA Re: AI track in MS--please respond!
C00509 00229 ∂29-Oct-84 0601 ATP.BLEDSOE@UTEXAS-20.ARPA [allegra!walker@Berkeley (Don Walker): the AAAI and an electronic library for the AI community]
C00515 00230 ∂29-Oct-84 0949 WITHGOTT@SU-CSLI.ARPA string on finger
C00516 00231 ∂29-Oct-84 0957 RA
C00517 00232 ∂29-Oct-84 1210 EMMA@SU-CSLI.ARPA Re: postdoc announcements
C00518 00233 ∂29-Oct-84 1217 RA AAAS symposium
C00519 00234 ∂29-Oct-84 1348 RPG Subcontracts
C00521 00235 ∂29-Oct-84 1445 RA
C00522 00236 ∂29-Oct-84 1654 FISHER@SU-SCORE.ARPA Tuesday lunches
C00524 00237 ∂29-Oct-84 1654 RA
C00525 00238 ∂29-Oct-84 1727 burton@Navajo HEP benchmark you wanted
C00529 00239 ∂29-Oct-84 2116 JJW 206 report
C00533 00240 ∂30-Oct-84 0709 ATP.BLEDSOE@UTEXAS-20.ARPA [AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>: [AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>: new person]]
C00541 00241 ∂30-Oct-84 0838 GOLUB@SU-SCORE.ARPA lunch
C00542 00242 ∂30-Oct-84 0843 RTC CS206
C00543 00243 ∂30-Oct-84 0902 RA
C00544 00244 ∂30-Oct-84 0926 GOLUB@SU-SCORE.ARPA lunch
C00545 00245 ∂30-Oct-84 0934 shore@nrl-css Re: an early bug (maybe)
C00547 00246 ∂30-Oct-84 1229 RA
C00548 00247 ∂30-Oct-84 1600 JMC*
C00549 00248 ∂30-Oct-84 1954 LIBRARY@SU-SCORE.ARPA New Books in the Math/CS Library
C00550 00249 ∂31-Oct-84 0059 cheriton@Pescadero CSD Facilities Committee - topics to address
C00554 00250 ∂31-Oct-84 0934 JJW@SU-AI.ARPA Meeting date
C00555 00251 ∂31-Oct-84 1001 cheriton@Pescadero On-line library
C00560 00252 ∂31-Oct-84 1054 RA
C00561 00253 ∂31-Oct-84 1117 RA
C00562 00254 ∂31-Oct-84 1321 RA
C00563 00255 ∂31-Oct-84 1348 VAL my draft on prioritized circumscription and separable formulas
C00564 00256 ∂31-Oct-84 1505 Spencer.PA@Xerox.ARPA Kurzweil Machine
C00565 00257 ∂31-Oct-84 1504 VAL correction for your workshop paper
C00566 00258 ∂31-Oct-84 1603 RA
C00567 00259 ∂31-Oct-84 2049 JDLH@SU-SCORE.ARPA Re: CSD Facilities Committee - topics to address
C00569 00260 ∂31-Oct-84 2216 @SU-SCORE.ARPA:cheriton@Pescadero Computer Facilities committee
C00571 00261 ∂31-Oct-84 2312 cheriton@Pescadero Proposal to buy SUN workstations
C00578 00262 ∂01-Nov-84 0852 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
C00580 00263 ∂01-Nov-84 0932 RA
C00581 00264 ∂01-Nov-84 0940 RA
C00582 00265 ∂01-Nov-84 1108 RA
C00583 00266 ∂01-Nov-84 1310 BRADFORD@SU-SIERRA.ARPA Guide for visitor from Lincoln Lab.?
C00585 00267 ∂01-Nov-84 1430 RA*
C00586 00268 ∂01-Nov-84 1436 DAVIES@SUMEX-AIM.ARPA AI for Semiconductor Fabrication
C00588 00269 ∂01-Nov-84 1556 YM PhD Orals scheduling
C00589 00270 ∂01-Nov-84 1659 @SU-SCORE.ARPA:DEK@SU-AI.ARPA
C00591 00271 ∂01-Nov-84 1751 SG invitation
C00593 00272 ∂01-Nov-84 1829 cheriton@Pescadero Meeting next week
C00595 00273 ∂01-Nov-84 2025 BARWISE@SU-CSLI.ARPA Policy of military funding
C00597 00274 ∂01-Nov-84 2208 CC.CLIVE@UTEXAS-20.ARPA HELP! Did you get the message I sent last week?
C00599 00275 ∂02-Nov-84 0800 BARWISE@SU-CSLI.ARPA MM and the Funding document
C00601 00276 ∂02-Nov-84 1154 RA
C00602 00277 ∂02-Nov-84 1344 @SU-CSLI.ARPA:GOGUEN@SRI-AI.ARPA Re: MM and the Funding document
C00604 00278 ∂02-Nov-84 1542 @SU-SCORE.ARPA:P.PIERRE@[36.48.0.1] A LOTS Vax.
C00607 00279 ∂02-Nov-84 1625 RA
C00608 00280 ∂02-Nov-84 1630 LIBRARY@SU-SCORE.ARPA The B Newsletter (B Programming Language) Who is interested?
C00610 00281 con-Nov-84 1649 GCOLE@SU-SCORE.ARPA Phone Company Lawsuit
C00613 00282 ∂02-Nov-84 2158 TRACZ@SU-SIERRA.ARPA
C00614 00283 ∂02-Nov-84 2210 TRACZ@SU-SIERRA.ARPA
C00615 00284 ∂02-Nov-84 2216 TRACZ@SU-SIERRA.ARPA
C00616 00285 ∂02-Nov-84 2221 ROB request for appointment
C00617 00286 ∂02-Nov-84 2246 ME Prancing Pony Bill
C00619 00287 ∂03-Nov-84 1533 HST thomas kurtz's address
C00620 00288 ∂04-Nov-84 0816 CLT watch out
C00621 00289 ∂04-Nov-84 1635 HST pictures back
C00622 00290 ∂04-Nov-84 1726 GOGUEN@SRI-AI.ARPA Course on Semantics of Computation
C00624 00291 ∂04-Nov-84 1808 forbus%uiucdcsb%uiuc.csnet@csnet-relay.arpa Re: page 11
C00633 00292 ∂04-Nov-84 2305 LLW@S1-A.ARPA Architectural Feast
C00636 00293 ∂05-Nov-84 1006 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 reminder
C00638 00294 ∂05-Nov-84 1032 STAN@SRI-AI.ARPA several things
C00639 00295 ∂05-Nov-84 1101 @SU-CSLI.ARPA:withgott.pa@Xerox.ARPA string on finger
C00641 00296 ∂05-Nov-84 1138 RA
C00642 00297 ∂05-Nov-84 1201 wilensky%ucbdali@Berkeley McCarthy's topic
C00645 00298 ∂05-Nov-84 1313 RA
C00646 00299 ∂05-Nov-84 1400 JMC*
C00647 00300 ∂05-Nov-84 1635 LLW@S1-A.ARPA Consulting Agreeements
C00650 00301 ∂05-Nov-84 1702 RA
C00651 00302 ∂05-Nov-84 1900 forbus%uiucdcsb%uiuc.csnet@csnet-relay.arpa Pumping and Intuition
C00654 00303 ∂05-Nov-84 2154 ROBERTA@SU-SCORE.ARPA phone call
C00655 00304 ∂05-Nov-84 2249 TAJNAI@SU-SCORE.ARPA IBM wine and cheese party
C00657 00305 ∂05-Nov-84 2351 LIBRARY@SU-SCORE.ARPA Journal of Intelligent Systems: Anyone interested?
C00661 00306 ∂06-Nov-84 0707 @MIT-MULTICS.ARPA:Bernard←Galler@UMich-MTS.Mailnet McCarthy's topic
C00662 00307 ∂06-Nov-84 0900 JMC*
C00663 00308 ∂06-Nov-84 0912 PACK@SRI-AI.ARPA Industrial Lectureship Committee
C00664 00309 ∂06-Nov-84 0922 RA
C00665 00310 ∂06-Nov-84 1046 ROBERTA@SU-SCORE.ARPA phone message
C00666 00311 ∂06-Nov-84 1233 RA
C00667 00312 ∂06-Nov-84 1445 ROBERTA@SU-SCORE.ARPA mail
C00668 00313 ∂06-Nov-84 1530 RA Paula Bauman, Livermore
C00669 00314 ∂06-Nov-84 1554 RA
C00670 00315 ∂06-Nov-84 1600 JMC*
C00671 00316 ∂06-Nov-84 1620 ROBERTA@SU-SCORE.ARPA phn ms
C00672 00317 ∂06-Nov-84 1631 RA Meeting at Xerox Wed., Nov. 7, @ 10:00
C00673 00318 ∂06-Nov-84 1731 CLT
C00674 00319 ∂06-Nov-84 2310 cheriton@Pescadero Re: Synapse
C00684 00320 ∂06-Nov-84 2349 JJW Sequoia
C00685 00321 ∂07-Nov-84 0953 RA III
C00686 00322 ∂07-Nov-84 0954 RA
C00687 00323 ∂07-Nov-84 1005 @SU-SCORE.ARPA:cheriton@Pescadero Cancel the Ph.D. program quick!
C00688 00324 ∂07-Nov-84 1006 cheriton@Pescadero Meeting tomorrow (Thurs).
C00689 00325 ∂07-Nov-84 1047 HST history book - permission for reprint
C00691 00326 ∂07-Nov-84 1142 ROBERTA@SU-SCORE.ARPA phn ms.
C00692 00327 ∂07-Nov-84 1143 RA Recruiting
C00693 00328 ∂07-Nov-84 1154 @SU-SCORE.ARPA:TW@SU-AI.ARPA Re: cancel the PhD program
C00695 00329 ∂07-Nov-84 1156 RA Nov. 19, meeting
C00696 00330 ∂07-Nov-84 1237 CLT
C00697 00331 ∂07-Nov-84 1324 JMB@S1-A.ARPA S-1 Mark IIB seminar
C00698 00332 ∂07-Nov-84 1649 RA Your ARPA account
C00699 00333 ∂07-Nov-84 1707 CLT progress report
C00701 00334 ∂07-Nov-84 1719 MS invitation
C00702 00335 ∂07-Nov-84 1923 TEX lektrisity
C00703 00336 ∂07-Nov-84 2257 LLW@S1-A.ARPA Architecture, Etc.
C00705 00337 ∂08-Nov-84 0900 JMC*
C00706 00338 ∂08-Nov-84 0930 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
C00709 00339 ∂08-Nov-84 0935 RA Meeting w/Dr. Bil Hogan, VP Honeywell
C00710 00340 ∂08-Nov-84 1024 pratt@Navajo Re: Professor Wu
C00712 00341 ∂08-Nov-84 1031 gvax.gries@Cornell.ARPA Re: Professor Wu
C00714 00342 ∂08-Nov-84 1053 HULLMAN@SU-SCORE.ARPA annual report
C00715 00343 ∂08-Nov-84 1350 minker@maryland Thanks for the Memories
C00718 00344 ∂08-Nov-84 1420 BSCOTT@SU-SCORE.ARPA Chris Goad
C00719 00345 ∂08-Nov-84 1503 RA
C00720 00346 ∂08-Nov-84 1506 RA
C00721 00347 ∂08-Nov-84 1512 RA Your participation in panel discussin, SJ State
C00723 00348 ∂08-Nov-84 2217 @SU-SCORE.ARPA:cheriton@Pescadero Re: cancel the PhD program
C00725 00349 ∂08-Nov-84 2259 @SU-SCORE.ARPA:reid@Glacier Re: cancel the PhD program
C00727 00350 ∂09-Nov-84 0855 BSCOTT@SU-SCORE.ARPA
C00728 00351 ∂09-Nov-84 0902 LIBRARY@SU-SCORE.ARPA Lisp Conferences
C00729 00352 ∂09-Nov-84 1153 MESEGUER@SRI-AI.ARPA your talk
C00734 00353 ∂09-Nov-84 1159 Allen.PA@Xerox.ARPA Confirmation of Kurzweil Demo Date
C00736 00354 ∂09-Nov-84 1302 MESEGUER@SRI-AI.ARPA Re: my talk
C00738 00355 ∂09-Nov-84 1324 SJG disagreement
C00739 00356 ∂09-Nov-84 1351 minker@maryland Counterexamples
C00743 00357 ∂09-Nov-84 1414 MESEGUER@SRI-AI.ARPA discussant
C00744 00358 ∂09-Nov-84 1434 LIBRARY@SU-SCORE.ARPA New Books in the Math/CS Library
C00748 00359 ∂09-Nov-84 1451 LIBRARY@SU-SCORE.ARPA Lisp 1984
C00749 00360 ∂09-Nov-84 1549 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
C00751 00361 ∂09-Nov-84 1604 RA
C00752 00362 ∂09-Nov-84 1607 BMOORE@SRI-AI.ARPA [Bob Moore <BMOORE@SRI-AI.ARPA>: research activities]
C00757 00363 ∂09-Nov-84 1613 CC.CLIVE@UTEXAS-20.ARPA 36-Bit Pioneers Roundtable invitation
C00759 00364 ∂09-Nov-84 1636 MADSEN@SU-CSLI.ARPA Workshop invitation
C00767 00365 ∂09-Nov-84 1649 @SU-SCORE.ARPA:MADSEN@SU-CSLI.ARPA Workshop announcement
C00775 00366 ∂09-Nov-84 1709 @SU-SCORE.ARPA:pratt@Navajo NSF and education
C00777 00367 ∂09-Nov-84 1716 ullman@diablo Bell awards
C00778 00368 ∂09-Nov-84 1822 @SU-SCORE.ARPA:JMC@SU-AI.ARPA NSF and education
C00780 00369 ∂10-Nov-84 0035 GENESERETH@SUMEX-AIM.ARPA Re: Confirmation of Kurzweil Demo Date
C00781 00370 ∂10-Nov-84 0900 JMC*
C00782 00371 ∂10-Nov-84 1133 cheriton@Pescadero Minutes: CSD facilities meeting on No.v 8th
C00786 00372 ∂10-Nov-84 1134 cheriton@Pescadero SUN workstation motion - please vote
C00795 00373 ∂10-Nov-84 1849 YM
C00796 00374 ∂11-Nov-84 1427 CL.BOYER@UTEXAS-20.ARPA
C00797 00375 ∂11-Nov-84 1915 RPG Multiprocessors
C00798 00376 ∂12-Nov-84 1132 SMC TeX files
C00799 00377 ∂12-Nov-84 1144 RA Meeting w/ Jeff Glaza
C00800 00378 Sarah, this appointment is apparently for you, because it has to do
C00801 00379 ∂12-Nov-84 1333 CC.CLIVE@UTEXAS-20.ARPA Re: declination
C00802 00380 ∂12-Nov-84 1357 RA
C00803 00381 ∂12-Nov-84 1507 RA Tuesday, Nov. 13
C00804 00382 ∂12-Nov-84 1522 RPG Multiprocessors
C00815 00383 ∂12-Nov-84 1544 cheriton@Pescadero Re: proposal to spend Stauffer money on SUNs
C00819 00384 ∂12-Nov-84 1545 JDLH@SU-SCORE.ARPA Re: SUN workstation motion - please vote
C00821 00385 ∂12-Nov-84 1547 JJW@SU-AI.ARPA Workstations
C00823 00386 ∂12-Nov-84 1546 JMC@SU-AI.ARPA proposal to spend Stauffer money on SUNs
C00825 00387 ∂12-Nov-84 2114 JMC@SU-AI.ARPA McSun vs. workstation
C00827 00388 ∂12-Nov-84 2209 RPG
C00828 00389 ∂12-Nov-84 2227 cheriton@Pescadero Re: Multiprocessors
C00831 00390 ∂12-Nov-84 2314 cheriton@Pescadero Re: McSun vs. workstation
C00837 00391 ∂12-Nov-84 2338 JMC@SU-AI.ARPA
C00838 00392 ∂13-Nov-84 1539 NILSSON@SRI-AI.ARPA
C00842 00393 ∂13-Nov-84 1634 JDLH@SU-SCORE.ARPA What are McSuns?
C00843 00394 ∂13-Nov-84 1953 YM PhD Orals time
C00844 00395 ∂13-Nov-84 2239 PITNER@SU-SIERRA.ARPA re: Flame: What the Democratic Party did wrong (from SAIL's BBOARD)
C00845 00396 ∂14-Nov-84 0117 JDLH@SU-SCORE.ARPA re: What are McSuns?
C00846 00397 ∂14-Nov-84 0212 @SU-SCORE.ARPA:KIPARSKY@SU-CSLI.ARPA Princiapls Meeting
C00847 00398 ∂14-Nov-84 0238 @SU-SCORE.ARPA:BARWISE@SU-CSLI.ARPA AI job
C00849 00399 ∂14-Nov-84 0421 @SU-SCORE.ARPA:BARWISE@SU-CSLI.ARPA Princiapls Meeting
C00851 00400 ∂14-Nov-84 1054 PETTY@RUTGERS.ARPA Nov. '84 tech-rep mailing
C00857 00401 ∂14-Nov-84 1119 BSCOTT@SU-SCORE.ARPA Couple of things
C00858 00402 ∂14-Nov-84 1152 FISHER@SU-SCORE.ARPA Meeting 11/20/84
C00860 00403 ∂14-Nov-84 1328 mogul@Navajo
C00861 00404 ∂14-Nov-84 1358 RA Reason
C00862 00405 ∂14-Nov-84 1445 mogul@Navajo
C00863 00406 ∂14-Nov-84 1445 pratt@Navajo Re: Prof. Pratt's new conjecture
C00866 00407 ∂14-Nov-84 1453 FISHER@SU-SCORE.ARPA re: Meeting 11/20/84
C00867 00408 ∂14-Nov-84 1500 @SU-SCORE.ARPA:NILSSON@SRI-AI.ARPA Re: Meeting 11/20/84
C00869 00409 ∂14-Nov-84 1618 RINDFLEISCH@SUMEX-AIM.ARPA IP/TCP Update for Symbolics 3600's
C00871 00410 ∂14-Nov-84 2102 WEGENER@SU-SCORE.ARPA Atari's additive synthesis VLSI chip for music/speech - sponsor sought
C00873 00411 ∂15-Nov-84 0311 @SU-SCORE.ARPA,@SU-CSLI.ARPA:Kay.pa@Xerox.ARPA Re: Princiapls Meeting
C00875 00412 ∂15-Nov-84 0356 @SU-SCORE.ARPA:JODY@SU-CSLI.ARPA
C00876 00413 ∂15-Nov-84 0432 @SU-SCORE.ARPA,@SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
C00878 00414 ∂15-Nov-84 0843 RINDFLEISCH@SUMEX-AIM.ARPA re: IP/TCP Update for Symbolics 3600's
C00879 00415 ∂15-Nov-84 0944 RA Bill Hogan
C00880 00416 ∂15-Nov-84 0934 RPG Russian Words
C00881 00417 ∂15-Nov-84 1033 BARWISE@SU-CSLI.ARPA Anniversary
C00883 00418 ∂15-Nov-84 1503 RPG
C00885 00419 ∂15-Nov-84 1513 LIBRARY@SU-SCORE.ARPA New Books in the Math/CS Library
C00887 00420 ∂15-Nov-84 1514 BSCOTT@SU-SCORE.ARPA Your Salary
C00889 00421 ∂15-Nov-84 1538 RA
C00890 00422 ∂15-Nov-84 1601 GLB
C00891 00423 ∂15-Nov-84 1754 BARWISE@SU-CSLI.ARPA Important Meeting
C00893 00424 ∂15-Nov-84 1753 RPG
C00895 00425 ∂16-Nov-84 1013 KAELBLING@SRI-AI.ARPA Learning
C00896 00426 ∂16-Nov-84 1300 RA paycheck
C00897 00427 ∂16-Nov-84 1430 RA
C00898 00428 ∂16-Nov-84 1442 JK
C00899 00429 ∂16-Nov-84 1510 RA
C00900 00430 ∂16-Nov-84 1513 GOLUB@SU-SCORE.ARPA appointments and slots
C00901 00431 ∂16-Nov-84 1531 RA 35 mm slides
C00902 00432 ∂16-Nov-84 1713 GOLUB@SU-SCORE.ARPA lunch on Tuesday
C00903 00433 ∂17-Nov-84 1252 GCOLE@SU-SCORE.ARPA Bibliography on Non-Monotonic Reasoning
C00905 00434 ∂17-Nov-84 1758 SMC VCR
C00906 00435 ∂17-Nov-84 2019 GOLUB@SU-SCORE.ARPA help wanted
C00908 00436 ∂18-Nov-84 1108 ENGELMORE@SUMEX-AIM.ARPA presidential address
C00977 00437 ∂18-Nov-84 2147 GOLUB@SU-SCORE.ARPA Re: Science Digest young scientists
C00978 00438 ∂19-Nov-84 0830 CLT
C00979 00439 ∂19-Nov-84 0937 RESTIVO@SU-SCORE.ARPA
C00980 00440 ∂19-Nov-84 1012 RA
C00981 00441 ∂19-Nov-84 1014 RA
C00982 00442 ∂19-Nov-84 1016 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 meeting reminder
C00985 00443 ∂19-Nov-84 1100 GOLUB@SU-SCORE.ARPA Karp
C00986 00444 ∂19-Nov-84 1123 INGRID@SU-CSLI.ARPA Betsy's Memo of October 8, 1984
C00987 00445 ∂19-Nov-84 1228 RA
C00988 00446 ∂19-Nov-84 1400 RA
C00989 00447 ∂19-Nov-84 1641 GOLUB@SU-SCORE.ARPA meeting
C00990 00448 ∂19-Nov-84 1645 CHEESEMAN@SRI-AI.ARPA Proposed Workshop
C00994 00449 ∂19-Nov-84 1742 SMC dinner?
C00995 00450 ∂19-Nov-84 1745 SMC
C00996 00451 ∂19-Nov-84 2237 GOLUB@SU-SCORE.ARPA lunch
C00997 00452 ∂20-Nov-84 0338 RWW new FOL
C00998 00453 ∂20-Nov-84 0908 RA
C00999 00454 ∂20-Nov-84 1153 YK
C01001 00455 ∂20-Nov-84 1303 @SU-SCORE.ARPA:JMC@SU-AI.ARPA Industry lecturers
C01004 00456 ∂20-Nov-84 1305 RWW jmc-lists
C01005 00457 ∂20-Nov-84 1334 RESTIVO@SU-SCORE.ARPA
C01007 00458 ∂20-Nov-84 1447 SG My boss at NTT will visit Stanford
C01009 00459 ∂20-Nov-84 1505 RPG CS reports
C01011 00460 ∂20-Nov-84 1510 LIBRARY@SU-SCORE.ARPA SOCRATES: Update and request for user opinions
C01017 00461 ∂20-Nov-84 1641 BARWISE@SU-CSLI.ARPA Next Tuesday's meeting
C01023 00462 ∂20-Nov-84 1647 100 (on TTY72, at TV-137) incompletion of cs206 course
C01025 00463 ∂20-Nov-84 1711 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
C01027 00464 ∂20-Nov-84 1718 BARWISE@SU-CSLI.ARPA Original conception
C01028 00465 ∂20-Nov-84 2213 RTC Common Lisp
C01029 00466 ∂21-Nov-84 0646 RA
C01030 00467 ∂21-Nov-84 0838 ullman@diablo Industrial Lecturers
C01031 00468 ∂21-Nov-84 1157 ullman@diablo re: Industrial Lecturers
C01032 00469 ∂21-Nov-84 1246 RA
C01033 00470 ∂21-Nov-84 1333 WIEDERHOLD@SRI-AI.ARPA Kling
C01034 00471 ∂21-Nov-84 1449 RA
C01035 00472 ∂21-Nov-84 1456 RA
C01036 00473 ∂21-Nov-84 1700 RINDFLEISCH@SUMEX-AIM.ARPA Symbolics 3600 Access
C01039 00474 ∂21-Nov-84 2159 pratt@Navajo Prof. Smith from China
C01042 00475 ∂22-Nov-84 1929 pratt@Navajo Seeing Ethiopia on a Marxist Diet
C01043 00476 ∂23-Nov-84 1254 NILSSON@SU-SCORE.ARPA Books and Publishers
C01048 00477 ∂24-Nov-84 1056 golub@Navajo supercomputing
C01051 00478 ∂25-Nov-84 0025 FOGELSONG@SU-SCORE.ARPA JMM's and your remarks on attaining the "Correct" view of Ethiopia
C01059 00479 ∂25-Nov-84 1137 GARDNER@SUMEX-AIM.ARPA Meeting Monday?
C01060 00480 ∂25-Nov-84 1419 JMM Discussion on bboard
C01061 00481 ∂25-Nov-84 1613 RESTIVO@SU-SCORE.ARPA Re: capitalist hearts
C01062 00482 ∂26-Nov-84 0929 STAN@SRI-AI.ARPA Anne Gardner
C01063 00483 ∂26-Nov-84 1004 RA dentist
C01064 00484 ∂26-Nov-84 1015 LIBRARY@SU-SCORE.ARPA Ethiopia, McCarthy, and SOCRATES
C01065 00485 ∂26-Nov-84 1044 RA nonmonotonic biliography
C01066 00486 ∂26-Nov-84 1050 RA Veronica Dahl's talk
C01067 00487 ∂26-Nov-84 1104 OHLANDER@USC-ISI.ARPA Program Summary
C01069 00488 ∂26-Nov-84 1350 RA John Nafeh
C01070 00489 ∂26-Nov-84 1530 GLB midterm
C01071 00490 ∂26-Nov-84 1620 RPG Synapse
C01072 00491 ∂26-Nov-84 1658 RA
C01073 00492 ∂26-Nov-84 1805 AAAI-OFFICE@SUMEX-AIM.ARPA [Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>: Artificial Intelligence Movie]
C01110 00493 ∂26-Nov-84 1808 SMC cars
C01111 00494 ∂26-Nov-84 1941 HULLMAN@SU-SCORE.ARPA report
C01113 00495 ∂26-Nov-84 1950 HULLMAN@SU-SCORE.ARPA AI info for annual report
C01115 00496 ∂26-Nov-84 2138 SMC
C01116 00497 ∂27-Nov-84 0826 BERG@SU-SCORE.ARPA books
C01117 00498 ∂27-Nov-84 0945 AMAREL@RUTGERS.ARPA Re: [Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>: Artificial Intelligence Movie]
C01119 00499 ∂27-Nov-84 1318 SMC cars
C01120 00500 ∂27-Nov-84 1411 BSCOTT@SU-SCORE.ARPA Joint US-Japanese Collaboration
C01121 00501 ∂27-Nov-84 1417 RA
C01122 00502 ∂27-Nov-84 1427 RA on your desk
C01123 00503 ∂27-Nov-84 1436 FISHER@SU-SCORE.ARPA Richard Karp
C01124 00504 ∂27-Nov-84 1526 LEP Industrial Lectureships
C01125 00505 ∂27-Nov-84 1656 @SU-CSLI.ARPA:TW@SU-AI.ARPA Thoughts on today's meeting
C01136 00506 ∂27-Nov-84 1707 BARWISE@SU-CSLI.ARPA [Terry Winograd <TW@SU-AI.ARPA>: Thoughts on today's meeting ]
C01148 00507 ∂27-Nov-84 2039 JOHN@SU-CSLI.ARPA [Jon Barwise <BARWISE@SU-CSLI.ARPA>: Next meeting]
C01150 00508 ∂28-Nov-84 0004 SMC favor
C01151 00509 ∂28-Nov-84 1149 LIBRARY@SU-SCORE.ARPA New Books in the Math/CS Library
C01153 00510 ∂28-Nov-84 1742 BARWISE@SU-CSLI.ARPA Carry over
C01154 00511 ∂28-Nov-84 2156 MADSEN@SU-CSLI.ARPA CSLI workshop on semantics of programs
C01157 00512 ∂28-Nov-84 2317 SMC cars
C01158 00513 ∂28-Nov-84 2355 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
C01161 00514 ∂29-Nov-84 0926 FEIGENBAUM@SUMEX-AIM.ARPA [Bruce Delagi <DELAGI@SUMEX-AIM.ARPA>: Alpha, Elis, and ...]
C01176 00515 ∂29-Nov-84 0938 LIBRARY@SU-SCORE.ARPA AT&T BELL LABORATORIECHNICAL JOURNAL: ISSUE ON UNIX
C01178 00516 ∂29-Nov-84 1025 RA nonmonotonic bibliography
C01179 00517 ∂29-Nov-84 1430 ERIC@SU-CSLI.ARPA Laurence R. Brothers
C01180 00518 ∂29-Nov-84 1547 RA Visitors from China
C01181 00519 ∂29-Nov-84 1604 HULLMAN@SU-SCORE.ARPA postdocs
C01182 00520 ∂29-Nov-84 1711 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
C01183 00521 ∂29-Nov-84 1739 @MIT-MC:RICH@MIT-OZ [Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>: Artificial Intelligence Movie]
C01187 00522 ∂29-Nov-84 1824 @SU-SCORE.ARPA:JMC@SU-AI.ARPA special seminar
C01188 00523 ∂29-Nov-84 2111 WIEDERHOLD@SUMEX-AIM.ARPA Re: special seminar
C01189 00524 ∂29-Nov-84 2136 FEIGENBAUM@SUMEX-AIM.ARPA Re: Japanese Lisp machines
C01192 00525 ∂29-Nov-84 2303 rmeier@su-star request for incomplete
C01194 00526 ∂30-Nov-84 0006 LLW@S1-A.ARPA Meeting
C01195 00527 ∂30-Nov-84 0958 RA Monica Strauss
C01196 00528 ∂30-Nov-84 1017 BSCOTT@SU-SCORE.ARPA Chris Goad
C01197 00529 ∂30-Nov-84 1103 RA
C01198 00530 ∂30-Nov-84 1123 cheriton@Pescadero SUN workstations
C01201 00531 ∂30-Nov-84 1126 BSCOTT@SU-SCORE.ARPA Re: Goad
C01203 00532 ∂30-Nov-84 1141 mogul@Navajo Re: SUN workstations
C01205 00533 ∂30-Nov-84 1148 RA Epistemology of AI
C01206 00534 ∂30-Nov-84 1243 PKANERVA@SU-CSLI.ARPA Reading for F1 meeting on Dec. 11
C01208 00535 ∂30-Nov-84 1436 @SU-CSLI.ARPA:MS@SU-AI.ARPA A Seminar on Programming Language
C01211 00536 ∂30-Nov-84 1437 BSCOTT@SU-SCORE.ARPA
C01212 00537 ∂30-Nov-84 1600 JMC*
C01213 00538 ∂30-Nov-84 1704 SG greetings
C01214 00539 ∂30-Nov-84 1716 TAJNAI@SU-SCORE.ARPA Forum program
C01215 00540 ∂30-Nov-84 1732 CHEESEMAN@SRI-AI.ARPA Proposed Workshop
C01219 00541 ∂30-Nov-84 2348 KROVETZ@SUMEX-AIM.ARPA technical reports
C01221 00542 ∂01-Dec-84 1019 BARWISE@SU-CSLI.ARPA IBM
C01223 00543 ∂01-Dec-84 1713 BARWISE@SU-CSLI.ARPA re: IBM
C01224 00544 ∂02-Dec-84 1343 @MIT-ML:DAVIS%MIT-OZ@MIT-MC Ought we to be in pictures?
C01231 00545 ∂02-Dec-84 2328 ENGELMORE@SUMEX-AIM.ARPA Re: Ought we to be in pictures?
C01235 00546 ∂03-Dec-84 0004 ME Prancing Pony Bill
C01237 00547 ∂03-Dec-84 0029 MADSEN@SU-CSLI.ARPA Workshop, Dec. 4
C01239 00548 ∂03-Dec-84 0926 TW
C01240 00549 ∂03-Dec-84 1000 JMC*
C01241 00550 ∂03-Dec-84 1000 JMC*
C01242 00551 ∂03-Dec-84 1035 RA mathew ginsberg
C01243 00552 ∂03-Dec-84 1120 ATP.BLEDSOE@UTEXAS-20.ARPA Re: Ought we to be in pictures?
C01245 00553 ∂03-Dec-84 1139 GOLUB@SU-SCORE.ARPA AFIPS award
C01246 00554 ∂03-Dec-84 1245 RA mileage
C01247 00555 ∂03-Dec-84 1339 GOLUB@SU-SCORE.ARPA
C01248 00556 ∂03-Dec-84 1356 RA
C01249 00557 ∂03-Dec-84 1414 RA malachi orals
C01250 00558 ∂03-Dec-84 1441 RA
C01251 00559 ∂03-Dec-84 1513 NILSSON@SU-SCORE.ARPA Nonmon Chapter
C01253 00560 ∂03-Dec-84 1515 TAJNAI@SU-SCORE.ARPA
C01259 00561 ∂03-Dec-84 1606 LIBRARY@SU-SCORE.ARPA Math/CS Technical Reports File in Socrates or Separate File:Need Opinions
C01262 00562 ∂03-Dec-84 1845 GARDNER@SUMEX-AIM.ARPA SRI
C01263 00563 ∂03-Dec-84 1851 SMC Dinner?
C01264 00564 ∂03-Dec-84 1900 YOM*
C01265 00565 ∂03-Dec-84 2239 cheriton@Pescadero SUN workstations again.
C01269 00566 ∂04-Dec-84 0924 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA f4 meeting reminder
C01271 00567 ∂04-Dec-84 1057 RA
C01272 00568 ∂04-Dec-84 1132 PETERS@SU-CSLI.ARPA Re: IBM
C01273 00569 ∂04-Dec-84 1220 RA LA trip 12/5
C01274 00570 ∂04-Dec-84 1444 RA
C01275 00571 ∂04-Dec-84 1603 LGD Stoyan book
C01276 00572 ∂04-Dec-84 1416 RA tickets
C01277 00573 ∂04-Dec-84 2051 TAJNAI@SU-SCORE.ARPA faculty liaison
C01279 00574 ∂04-Dec-84 2125 FISHER@SU-SCORE.ARPA BRS-Shared Instrumentaion Grant (SIG) Program
C01281 00575 ∂05-Dec-84 0018 GLB
C01282 00576 ∂05-Dec-84 0759 TAJNAI@SU-SCORE.ARPA re: faculty liaison
C01283 00577 ∂05-Dec-84 0945 SHORTLIFFE@SUMEX-AIM.ARPA Re: Ought we to be in pictures?
C01286 00578 ∂05-Dec-84 0958 SMC phone message
C01287 00579 ∂05-Dec-84 1056 RA CS206-Tom Geffel
C01288 00580 ∂05-Dec-84 1114 JDLH@SU-SCORE.ARPA Re: SUN workstations
C01289 00581 ∂05-Dec-84 1152 KUO (on TTY63, at TV-132 1152)
C01290 00582 ∂05-Dec-84 1158 DAC
C01291 00583 ∂05-Dec-84 1236 RTC CS206 Course Evaluations
C01292 00584 ∂05-Dec-84 1425 DIEP@SU-SCORE.ARPA Final
C01293 00585 ∂05-Dec-84 1630 BARWISE@SU-CSLI.ARPA Kennedy and Drell
C01295 00586 ∂05-Dec-84 1635 @SRI-AI.ARPA:BARWISE@SU-CSLI.ARPA Sam, not Joe, Winograd
C01296 00587 ∂05-Dec-84 1659 RA Chudnovsky
C01297 00588 ∂05-Dec-84 1721 TAJNAI@SU-SCORE.ARPA Need your opinion
C01299 00589 ∂05-Dec-84 1912 NILSSON@SRI-AI.ARPA Re: Sam, not Joe, Winograd
C01302 00590 ∂05-Dec-84 2151 @SU-SCORE.ARPA:ullman@diablo Re: Need your opinion
C01303 00591 ∂06-Dec-84 0851 LEIB@SU-SCORE.ARPA Re: The L.A. Times is getting too big, and actresses' dogs are getting too small.
C01304 00592 ∂06-Dec-84 1226 REGES@SU-SCORE.ARPA TA for 224
C01305 00593 ∂06-Dec-84 1228 REGES@SU-SCORE.ARPA correction
C01306 00594 ∂06-Dec-84 1249 OHLANDER@USC-ISI.ARPA Research summary
C01312 00595 ∂06-Dec-84 1316 @SU-SCORE.ARPA:KARP@SUMEX-AIM.ARPA TGIF
C01313 00596 ∂06-Dec-84 1342 LIBRARY@SU-SCORE.ARPA Math/CS Library New Books
C01315 00597 ∂06-Dec-84 1352 LIBRARY@SU-SCORE.ARPA Math/CS Library New Books --continued
C01317 00598 ∂06-Dec-84 1411 REGES@SU-SCORE.ARPA Senior Survey: Computers
C01320 00599 ∂06-Dec-84 1412 RA invoice inference
C01321 00600 ∂06-Dec-84 1433 REGES@SU-SCORE.ARPA re: TA for 224
C01322 00601 ∂06-Dec-84 1441 HULLMAN@SU-SCORE.ARPA party
C01323 00602 ∂06-Dec-84 1542 gefell@Navajo cs206
C01325 00603 ∂06-Dec-84 1713 LIBRARY@SU-SCORE.ARPA Computational Intelligence--New Journal
C01328 00604 ∂06-Dec-84 1815 RTC CS206 exam
C01329 00605 ∂06-Dec-84 1847 RTC re: CS206 exam
C01330 00606 ∂06-Dec-84 2103 BACH@SU-SCORE.ARPA Re: The L.A. Times is getting too big, and actresses' dogs are getting too small.
C01331 00607 ∂06-Dec-84 2111 JK
C01334 00608 ∂07-Dec-84 0201 FOGELSONG@SU-SCORE.ARPA A.J. Thomas
C01335 00609 ∂07-Dec-84 0859 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Course announcement
C01340 00610 ∂07-Dec-84 1307 FOGELSONG@SU-SCORE.ARPA re: A.J. Thomas
C01341 00611 ∂07-Dec-84 1340 AAAI-OFFICE@SUMEX-AIM.ARPA Kowalik-Couping Symbolic & Numerical Computing in Expert Systems
C01343 00612 ∂07-Dec-84 1359 gefell@Navajo cs206
C01345 00613 ∂07-Dec-84 1439 RTC Late exams
C01346 00614 ∂07-Dec-84 1514 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA future meetings
C01348 00615 ∂07-Dec-84 1646 JJW SAIL account for Joe Halpern
C01349 00616 ∂07-Dec-84 1657 RA
C01350 00617 ∂07-Dec-84 1738 @SU-CSLI.ARPA:withgott.pa@Xerox.ARPA Research summary for the last meeting of the Fall Quarter
C01354 00618 ∂07-Dec-84 1740 @SU-CSLI.ARPA:withgott.pa@Xerox.ARPA summary
C01357 00619 ∂07-Dec-84 1752 SMC
C01358 00620 ∂08-Dec-84 1221 TIBSHIRANI@SU-SCORE.ARPA Car
C01359 00621 ∂09-Dec-84 0912 JDLH@SU-SCORE.ARPA [Leonor M. Abraido <ABRAIDO@SU-SCORE.ARPA>: Needed--Graphics Facilities]
C01363 00622 ∂09-Dec-84 1300 VAL Breaking the boat
C01366 00623 ∂10-Dec-84 0900 JMC*
C01367 00624 ∂10-Dec-84 0920 LIBRARY@SU-SCORE.ARPA Socrates, Ethernet Connection, & Collecting Citations and Sendig via electronic mail
C01370 00625 ∂10-Dec-84 1011 RA
C01371 00626 ∂10-Dec-84 1029 RESTIVO@SU-SCORE.ARPA
C01373 00627 ∂10-Dec-84 1029 LIBRARY@SU-SCORE.ARPA Khrushchev Search on Socrates
C01375 00628 ∂10-Dec-84 1100 JMC*
C01376 00629 ∂10-Dec-84 1139 RA
C01377 00630 ∂10-Dec-84 1159 RA
C01378 00631 ∂10-Dec-84 1225 RA
C01379 00632 ∂10-Dec-84 1322 RA
C01380 00633 ∂10-Dec-84 1414 GOLUB@SU-SCORE.ARPA lunch
C01381 00634 ∂10-Dec-84 1432 GOLUB@SU-SCORE.ARPA Faculty meeting
C01382 00635 ∂10-Dec-84 1455 TAJNAI@SU-SCORE.ARPA EG&G Idaho
C01383 00636 ∂10-Dec-84 1540 RA
C01384 00637 ∂10-Dec-84 1543 RA
C01385 00638 ∂10-Dec-84 1545 RA Final and TV students
C01386 00639 ∂10-Dec-84 2154 @SU-SCORE.ARPA:cheriton@Pescadero Vote: should we buy Dept. SUN workstations
C01389 00640 ∂10-Dec-84 2246 REGES@SU-SCORE.ARPA Dave's SUNs
C01392 00641 ∂11-Dec-84 0936 @SU-SCORE.ARPA:lantz@Pescadero Ridge Computers open house
C01394 00642 ∂11-Dec-84 0943 LIBRARY@SU-SCORE.ARPA New Books -- Math/CS Library
C01397 00643 ∂11-Dec-84 0953 L.LANSDALE@LOTS-A AI and Supercomputing
C01399 00644 ∂11-Dec-84 1002 @SU-SCORE.ARPA:ullman@diablo Re: Vote: should we buy Dept. SUN workstations
C01400 00645 ∂11-Dec-84 1012 @SU-SCORE.ARPA:ullman@diablo Re: Dave's SUNs
C01401 00646 ∂11-Dec-84 1021 AAAI-OFFICE@SUMEX-AIM.ARPA AAAI's use of the new file computer
C01404 00647 ∂11-Dec-84 1038 JJW Synapse
C01408 00648 ∂11-Dec-84 1048 @SU-SCORE.ARPA:TW@SU-AI.ARPA Proposal for suns
C01409 00649 ∂11-Dec-84 1147 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA meeting time
C01411 00650 ∂11-Dec-84 1352 RA
C01412 00651 ∂11-Dec-84 1514 AAAI-OFFICE@SUMEX-AIM.ARPA HPP Film
C01415 00652 ∂12-Dec-84 0834 GOLUB@SU-SCORE.ARPA New Chairman
C01416 00653 ∂12-Dec-84 0915 @SU-SCORE.ARPA:DEK@SU-AI.ARPA to Cheriton re SUNs
C01417 00654 ∂12-Dec-84 0925 LIBRARY@SU-SCORE.ARPA Math/CS Library Services by Electronic Mail
C01422 00655 ∂12-Dec-84 1026 RA
C01423 00656 ∂12-Dec-84 1034 RA transparencies
C01424 00657 ∂12-Dec-84 1125 RA
C01425 00658 ∂12-Dec-84 1248 RA sick
C01426 00659 ∂12-Dec-84 1306 AI.WOODY@MCC.ARPA Your visti to MCC
C01427 00660 ∂12-Dec-84 1548 RTC
C01429 00661 ∂12-Dec-84 1626 SJG dinner some time?
C01430 00662 ∂12-Dec-84 1650 GOLUB@SU-SCORE.ARPA Reviewing proposals
C01432 00663 ∂12-Dec-84 1718 CHEESEMAN@SRI-AI.ARPA Probability and AI Workshop
C01442 00664 ∂12-Dec-84 2332 VAL unique names
C01443 00665 ∂13-Dec-84 1103 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 meeting time
C01445 00666 ∂13-Dec-84 1300 AI.WOODY@MCC.ARPA re: Your visti to MCC
C01448 00667 ∂13-Dec-84 1438 RTC CS206 files moved
C01449 00668 ∂13-Dec-84 1438 RA
C01450 00669 ∂13-Dec-84 1611 RA Austin flight
C01451 00670 ∂13-Dec-84 1619 RA make-up exam for Ben Fisk
C01452 00671 ∂13-Dec-84 2302 @SU-SCORE.ARPA:LAURENCE@SU-CSLI.ARPA recommendations, etc.
C01457 00672 ∂13-Dec-84 2340 LLW@S1-A.ARPA DoE Wackiness
C01459 00673 ∂14-Dec-84 0849 brand%ucbarpa@Berkeley parrallel lisps
C01461 00674 ∂14-Dec-84 1134 RA Austin Texas
C01462 00675 ∂14-Dec-84 1135 RA lunch date
C01463 00676 ∂14-Dec-84 1621 RA flight back from Austin
C01464 00677 ∂14-Dec-84 1701 TOB your chess bet
C01465 00678 ∂14-Dec-84 1753 JODY@SU-CSLI.ARPA Decus
C01467 00679 ∂14-Dec-84 2000 JMC*
C01468 00680 ∂14-Dec-84 2040 dswise%indiana.csnet@csnet-relay.arpa First LISP conference
C01470 00681 ∂15-Dec-84 1001 RESTIVO@SU-SCORE.ARPA paper & no.
C01471 00682 ∂15-Dec-84 1033 CLT reminder
C01472 00683 ∂15-Dec-84 1715 JMC*
C01473 00684 ∂15-Dec-84 2211 SMC terminal
C01474 00685 ∂15-Dec-84 2308 @SU-SCORE.ARPA:WIEDERHOLD@SUMEX-AIM.ARPA Re: Vote: should we buy Dept. SUN workstations
C01476 00686 ∂16-Dec-84 1330 HULLMAN@SU-SCORE.ARPA party
C01477 00687 ∂16-Dec-84 1426 @SU-SCORE.ARPA:reid@Glacier FYI: a letter from EWD
C01483 00688 ∂17-Dec-84 0755 G.RYLAND@SU-SCORE.ARPA Brown -> Jim Jones
C01484 00689 ∂17-Dec-84 0813 JAMIE@SU-CSLI.ARPA Betsy's wedding
C01485 00690 ∂17-Dec-84 0900 JMC* call Jacobson about Bell
C01486 00691 ∂17-Dec-84 1417 RPG Sequent
C01487 00692 ∂17-Dec-84 1715 CLT thursday
C01488 00693 ∂17-Dec-84 2325 HST invited talk
C01489 00694 ∂17-Dec-84 2329 @SU-SCORE.ARPA:cheriton@Pescadero Re: FYI: a letter from EWD
C01490 00695 ∂17-Dec-84 2335 HST gwai85
C01492 00696 ∂18-Dec-84 0034 LLW@S1-A.ARPA DoE Follies
C01493 00697 ∂18-Dec-84 0322 LLW@S1-A.ARPA More Follies
C01495 00698 ∂18-Dec-84 0836 GROSOF@SU-SCORE.ARPA READ NOW! sudden opportunity- wrt your MCC trip
C01497 00699 ∂18-Dec-84 0900 CLT*
C01498 00700 ∂18-Dec-84 0900 JMC*
C01499 00701 ∂18-Dec-84 0950 BOSACK@SU-SCORE.ARPA Bitnet to SLAC
C01500 00702 ∂18-Dec-84 1018 RA CS206 grades
C01501 00703 ∂18-Dec-84 1029 CLT fateman
C01502 00704 ∂18-Dec-84 1101 SMC TERMINALS
C01503 00705 ∂18-Dec-84 1359 RA final fr Ben Fisk
C01504 00706 ∂18-Dec-84 1409 GROSOF@SU-SCORE.ARPA trip to MCC
C01505 00707 ∂18-Dec-84 1458 SG Nonmonotonic Symposium / Is the proceeding available?
C01506 00708 ∂18-Dec-84 1608 RA
C01507 00709 ∂18-Dec-84 1714 GOLUB@SU-SCORE.ARPA annoncements
C01509 00710 ∂18-Dec-84 1718 GOLUB@SU-SCORE.ARPA Margaret Olender
C01511 00711 ∂18-Dec-84 1736 Mailer failed mail returned
C01513 00712 ∂18-Dec-84 1839 SG Thank you / Proceeding
C01514 00713 ∂18-Dec-84 2045 ELLIOTT%SLACVM.BITNET@Berkeley BITNET mail follows
C01516 00714 ∂18-Dec-84 2310 HST gwai85
C01517 00715 ∂18-Dec-84 2329 BOSACK@SU-SCORE.ARPA Re: mail to SLAC
C01518 00716 ∂19-Dec-84 0201 LLW@S1-A.ARPA Clearances and PSQs
C01521 00717 ∂19-Dec-84 0807 RPG Burton Smith
C01522 00718 ∂19-Dec-84 0852 RINDFLEISCH@SUMEX-AIM.ARPA Re: AI and Supercomputing
C01524 00719 ∂19-Dec-84 0900 JMC*
C01525 00720 ∂19-Dec-84 1218 TAJNAI@SU-SCORE.ARPA EG&G
C01526 00721 ∂19-Dec-84 1324 RA
C01527 00722 ∂19-Dec-84 1325 RA
C01528 00723 ∂19-Dec-84 1336 Allen.PA@Xerox.ARPA Kurzweil Machine
C01530 00724 ∂19-Dec-84 1339 PACK@SU-SCORE.ARPA [Marianne Winslett <WINSLETT@SU-SCORE.ARPA>: [jbn@FORD-WDL1.ARPA: Re: industrial lectureships]]
C01533 00725 ∂19-Dec-84 1353 AI.WOODY@MCC.ARPA Re: visit
C01535 00726 ∂19-Dec-84 1407 SJG astronaut stats
C01536 00727 ∂19-Dec-84 1603 RA Topics drawer
C01537 00728 ∂19-Dec-84 1614 TAJNAI@SU-SCORE.ARPA Re: dithering about EG&G
C01538 00729 ∂19-Dec-84 2243 pratt@Navajo Industrial Lecturer
C01540 00730 ∂20-Dec-84 0900 JMC*
C01541 00731 ∂20-Dec-84 0925 L.LANSDALE@[36.48.0.1] Re: AI and Supercomputing
C01553 00732 ∂20-Dec-84 0942 RA cancelled check
C01554 00733 ∂20-Dec-84 1023 RA
C01555 00734 ∂20-Dec-84 1049 RA
C01556 00735 ∂20-Dec-84 1143 HENJUM@SU-SCORE.ARPA re: Answer (from SAIL's BBOARD)
C01558 00736 ∂20-Dec-84 1145 HENJUM@SU-SCORE.ARPA Excuse the previous msg...
C01559 00737 ∂20-Dec-84 1518 fateman%ucbdali@Berkeley meeting about parallel lisp dialects
C01562 00738 ∂21-Dec-84 0944 RPG Sequent
C01563 00739 ∂21-Dec-84 1002 YM Example where unification buys you more:
C01565 00740 ∂21-Dec-84 1132 SHAHN@SUMEX-AIM.ARPA Something seen in Human-Nets
C01571 00741 ∂22-Dec-84 1856 ATP.BLEDSOE@UTEXAS-20.ARPA Times for another visit
C01573 00742 ∂23-Dec-84 1203 VAL paper on prioritized circumscription
C01574 00743 ∂23-Dec-84 2000 JMC*
C01575 00744 ∂23-Dec-84 2100 JMC*
C01576 00745 ∂24-Dec-84 0900 JMC*
C01577 00746 ∂24-Dec-84 0900 JMC*
C01578 00747 ∂24-Dec-84 0900 JMC*
C01579 00748 ∂24-Dec-84 1310 CLT project q
C01580 00749 ∂24-Dec-84 1322 ME info
C01581 00750 ∂24-Dec-84 1604 vardi@diablo Thanks
C01582 00751 ∂24-Dec-84 2124 CLT reference
C01583 00752 ∂24-Dec-84 2233 POURNE@MIT-MC Pournelle's story
C01584 00753 ∂26-Dec-84 0900 JMC*
C01585 00754 ∂26-Dec-84 0900 JMC*
C01586 00755 ∂26-Dec-84 0858 RPG Sequent
C01587 00756 ∂26-Dec-84 1353 ATP.BLEDSOE@UTEXAS-20.ARPA re: Times for another visit
C01589 00757 ∂26-Dec-84 1806 JK
C01590 00758 ∂27-Dec-84 0941 RA
C01591 00759 ∂27-Dec-84 1111 RA
C01592 00760 ∂27-Dec-84 1326 CLT mtg with les
C01593 00761 ∂27-Dec-84 1354 AAAI@SRI-AI.ARPA elections
C01595 00762 ∂27-Dec-84 2000 JMC*
C01596 00763 ∂28-Dec-84 0916 RA
C01597 00764 ∂28-Dec-84 1417 RA
C01598 00765 ∂28-Dec-84 1528 RA
C01599 00766 ∂29-Dec-84 0600 NET-ORIGIN@MIT-MC Course. (Fifth mailing attempt).
C01602 ENDMK
C⊗;
∂01-Oct-84 0036 dsouza%hplabs.csnet@csnet-relay.arpa CS206 questions
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 1 Oct 84 00:36:04 PDT
Received: from hplabs by csnet-relay.csnet id ae26163; 1 Oct 84 3:15 EDT
Date: Sun, 30 Sep 84 20:10:44 pdt
From: Roy D'Souza <@csnet-relay.arpa,@hplabs.CSNET:dsouza@hplabs.CSNET>
Received: by HP-VENUS id AA27988; Sun, 30 Sep 84 20:10:44 pdt
Message-Id: <8410010310.AA27988@HP-VENUS>
Organization: Hewlett-Packard Laboratories
Division: Computer Research Center
Lab: Applications Technology Laboratory
Department: Computing Services Department
Location: 3L/C34 1501 Page Mill Rd. Palo Alto Ca 94304
Phone: (415) 857-7557
To: rtc%su-ai.arpa@csnet-relay.arpa
Subject: CS206 questions
Cc: b.bellin%su-ai.arpa@csnet-relay.arpa, bellin%su-ai.arpa@csnet-relay.arpa,
c.casley%su-ai.arpa@csnet-relay.arpa, casley%su-ai.arpa@csnet-relay.arpa,
mccarthy%su-ai.arpa@csnet-relay.arpa
Source-Info: From (or Sender) name not authenticated.
I am a student of CS206 and would appreciate it if you could answer some
of my questions below.
1) McCarthy suggested that I move the version of Common Lisp on LOTS to
our Dec20s at HPLABS. I talked to Mr. Bellin about this a month ago,
Could you possibly give me more details on how I could do this ?
2) I would also like to move EKL to one of our machines for convenience
of using it for the class assignments. Could you possibly let me know
from whom I would get the permission to do this.
3) Since the SITN courier system takes some time, would it be possible
for me to collect copies of handouts from you during your office hours ?
I have'nt gotten my handout #1 and handout #2 yet, even though others
at HPLabs taking classes have gotten theirs.
4) Would it be possible to come in person & purchase the McCarthy & Talcott
book and the EKL reference manual ?.
5) Is Prof. McCarthy on Csnet ?. I would like to make a small suggestion
to him. I would appreciate it if you could relay this to him if you
get the opportunity: It would be of great help if the handouts were
displayed on the overhead projection system when they are distributed ?.
(It is possible that Prof. McCarthy did this, but the SITN camera never
focussed on it). This would help because right after handing out
handouts, a professor is inclined to discuss them, and SITN viewers have
to guess what is going on.
Thanks much!
Roy D'Souza (415)-857-7557 dsouza@hplabs
∂01-Oct-84 0618 ATP.BLEDSOE@UTEXAS-20.ARPA [John McCarthy <JMC@SU-AI.ARPA>: promoting basic research in AI ]
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 1 Oct 84 06:18:22 PDT
Date: Mon 1 Oct 84 08:19:07-CDT
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: [John McCarthy <JMC@SU-AI.ARPA>: promoting basic research in AI ]
To: jmc@SU-AI.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
John, When I asked you to chair this committee (for which you volumteered)
I asked you to suggest any additional members that you might like. There
is no particular hurry, but just wanted you to know that we will not add
others until we hear from you. Woody
---------------
Return-Path: <JMC@SU-AI.ARPA>
Received: from SU-AI.ARPA by UTEXAS-20.ARPA with TCP; Sat 11 Aug 84 12:29:11-CDT
Date: 11 Aug 84 1017 PDT
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: promoting basic research in AI
To: bledsoe@UTEXAS-20.ARPA
This didn't occur to me Wednesday.
Much of the complaint about the conference, etc. amounts to saying
that basic research in AI is getting short shrift compared to applications.
As a scientific society, AAAI should promote basic research, and it occurs
to me that there are several ways of doing it.
1. It is possible to make the argument that the ratio of basic research
to applied research in AI should be higher than in other sciences, because
the applications being presently attempted are jeopardized by lack of
basic knowledge.
2. I think it will be effective to jawbone various organizations doing AI
to put more effort into basic research. I attacked Gomory last Fall about
IBM's lack of participation in AAAI Conferences, and they did much better
this time. At least they had a booth. I also have argued with TI people
about this. In each case the arguments were listened to.
3. It might also be effective to needle DARPA and NSF (perhaps even MCC)?
ICOT needs to be pushed in that direction, but that's not really our
business.
Therefore, I suggest that you appoint a committee on basic research
in AI. I volunteer to be chairman. The committee would consider what AAAI
could do to improve the state of basic research. However, I would welcome
the appointment as a base from which to continue and intensify arguing with
organizations doing research in AI to do more basic research.
-------
∂01-Oct-84 0800 JMC*
bank
∂01-Oct-84 0904 DIKRAN@SU-CSLI.ARPA
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 1 Oct 84 09:03:55 PDT
Date: Mon 1 Oct 84 09:03:38-PDT
From: Dikran Karagueuzian <DIKRAN@SU-CSLI.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 30 Sep 84 21:54:00-PDT
Thanks for letting me know. Please let me know
if you need any other reports.
--Dikran
-------
∂01-Oct-84 1000 JMC*
National security lunch?
∂01-Oct-84 1022 oliger@Navajo Re: Visit to Denelcor
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 1 Oct 84 10:21:57 PDT
From: Joseph Oliger <oliger@Navajo>
Date: 1 Oct 1984 1020-PDT (Monday)
To: John McCarthy <JMC@SU-AI.ARPA>
Cc: oliger@Navajo
Subject: Re: Visit to Denelcor
In-Reply-To: John McCarthy <JMC@SU-AI.ARPA> / 28 Sep 84 1140 PDT.
I am on jury duty this week and am not sure whether or not I will be
called. It seems likely not at this point. If this is true I could go
to Denver and am willing to do so if you think it would aid our cause.
Let me know if you want me to go. If you think it is important enough
I can always beg off the jury duty too if it should happen.
Joe
∂01-Oct-84 1029 ME 1985.xgp
∂30-Sep-84 2023 JMC
How about a 1985.xgp[up,doc]?
ME - OK, it's done.
∂01-Oct-84 1051 GOLUB@SU-SCORE.ARPA Vote
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 1 Oct 84 10:51:09 PDT
Date: Mon 1 Oct 84 10:44:36-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Vote
To: Full-Professors: ;
I am about to submit the papers on Karp to the Dean's office.
Unfortunately, I did not carefully record everyone's vote on this
appointment.
Please indicate to me whether you are in favor of this appointment,
abstain, or oppose it. If you are opposed, a sentence or two, giving your
reasons would be appreciated.
Please get your vote to me by Oct 3.
GENE
-------
∂01-Oct-84 1155 MOGUL@SU-SCORE.ARPA re: PARC Forum on Thermonuclear Danger (from SAIL's BBOARD)
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 1 Oct 84 11:55:08 PDT
Date: Mon 1 Oct 84 11:48:51-PDT
From: Jeffrey Mogul <MOGUL@SU-SCORE.ARPA>
Subject: re: PARC Forum on Thermonuclear Danger (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA, su-bboards@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 29 Sep 84 00:04:00-PDT
jmc - A forum defined by a propaganda film is scarcely with of the
name.
As long as you've brought up "definitions", my dictionary defines "forum" as
1. the public square of an ancient Roman city 2. an
assembly, program, etc. for the discussion of public
matters
Obviously, John only remembered the first definition, since the
BBOARD announcement clearly reads "Open discussion will follow the
film presentation."
Seriously, his statement is disingenuous, at best. There was no
implication in the announcement that the film is a documentary, but
this does not mean that the "forum" is thereby somehow dishonest.
During the "debates" this month, Ronald Reagan will presumably begin
with an opening statement supporting his point of view, but whether or
not this statement is balanced does not affect his honesty (or lack
of it.) The same goes for any other discussion where people hold differing
views. I see no reason why views presented on film should not be
treated the same way.
I have no connection with the forum or film, save for agreement
with the "perspectives" of some of the people involved. I simply do
not appreciate this sort of snide imputation of dishonesty.
-------
∂01-Oct-84 1312 TREITEL@SUMEX-AIM.ARPA re: PARC Forum on Thermonuclear Danger (from SAIL's BBOARD)
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 1 Oct 84 13:12:04 PDT
Date: Mon 1 Oct 84 13:09:36-PDT
From: Richard Treitel <TREITEL@SUMEX-AIM.ARPA>
Subject: re: PARC Forum on Thermonuclear Danger (from SAIL's BBOARD)
To: MOGUL@SU-SCORE.ARPA
cc: JMC@SU-AI.ARPA, su-bboards@SU-SCORE.ARPA, treitel@SUMEX-AIM.ARPA
In-Reply-To: Message from "Jeffrey Mogul <MOGUL@SU-SCORE.ARPA>" of Mon 1 Oct 84 11:57:53-PDT
Let's just note that the discussion will be "open" rather than "open-minded".
If JMC objects to the idea of a forum whose main speaker, and (presumably)
organiser(s) all share the same point of view BUT try to give the appearance
that they will be receptive to opposing points of view, I suggest that this
would indeed be dishonest and deceptive, but that no such appearance has in
fact been given.
- Richard
P.S. this is not to imply that preaching to the converted is always harmless.
-------
∂01-Oct-84 1347 RA
Marla Miller, an attorney, needs expert advice for a patent. Her # 434 1600.
∂01-Oct-84 1350 RA
1. Les Earnest called (56) 986 9400 re: scheduling a visit.
2. I think I didn't get the name of the file you gave me this morning
(re: contacting people for the Denver trip) could you give it to me again.
3. If you are willing to come back from Denver at 7:50 instead of 5:43
you can save some money. The 5:43 flight is $285 and the 7:50 one is
$100.
∂01-Oct-84 1512 CLT logic mailing list
To: JMC, YM
re: the messages below --
i removed csli-friends from my mailing list, as i was using the old -SRI
version. at jon byy's suggestion i am adding csli-research - he
claims that goes to people in the area rather that `all over the world'.
I have reinstated you both directly in my mailing list.
If you get two copies of the next announcement let me know!
---------------------------------------------------------------------------
∂28-Sep-84 1505 YM Logic mailing list
It seems that you have removed CSLI friends from your logic mailing so please
add me to the list (unless you are going to add FRIENDS@CSLI again).
Thanks,
Yoni
∂29-Sep-84 0008 JMC
Please put me back on the logic mailing list.
∂01-Oct-84 1625 Mailer failed mail returned
To: JMC
The following message has expired without successful delivery to recipient(s):
rwg@SCRC-STONY-BROOK.ARPA
------- Begin undelivered message: -------
∂28-Sep-84 1725 JMC
To: rwg@SCRC-STONY-BROOK.ARPA
Chudnovsky 212 864-5320
------- End undelivered message -------
∂02-Oct-84 0134 Spencer.PA@Xerox.ARPA Kurzweil Machine
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 2 Oct 84 01:33:56 PDT
Received: from Cabernet.MS by ArpaGateway.ms ; 02 OCT 84 00:50:31 PDT
Date: 1 Oct 84 11:59:46 PDT (Monday)
From: Spencer.PA@XEROX.ARPA
Subject: Kurzweil Machine
To: JMC@SU-AI.ARPA (John McCarthy)
cc: Diebert.PA@XEROX.ARPA, Allen.PA@XEROX.ARPA, Spencer.PA@XEROX.ARPA
John, Tim Diebert is the person who has set up and knows the most about
our Kurzweil machine. We've not had time to become fully acquainted
with it and, hence, may be less knowledgeable than you would like. Tim
would be glad to give you a demonstration of what we have. If we can
arrange a time when I'm here, I'd like to sit in on this as well and
maybe spend a few minutes chatting about Stanford and PARC at the end of
that time. I'll be in town most of the week of 8 October and then won't
be back until early November.
Enjoyed the day with you and the others from the Computer Science
Department. Look forward to seeing you soon.
Bill
∂02-Oct-84 0639 @SU-SCORE.ARPA:BHAYES-ROTH@SUMEX-AIM.ARPA common sense
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Oct 84 06:39:27 PDT
Received: from SUMEX-AIM.ARPA by SU-SCORE.ARPA with TCP; Tue 2 Oct 84 06:38:24-PDT
Date: Tue 2 Oct 84 06:39:58-PDT
From: Barbara Hayes-Roth <BHAYES-ROTH@SUMEX-AIM.ARPA>
Subject: common sense
To: mccarthy@SU-SCORE.ARPA
cc: bhayes-roth@SUMEX-AIM.ARPA
Stanford-Phone: (415) 497-4879
Professor McCarthy -
I enjoyed your lecture on common sense reasoning at the AAAI meeting in
Austin. I wonder if you would be willing to send me hard copies of your
slides and any recent papers on the subject.
Thank you,
Barbara Hayes-Roth
Heuristic Programming Project
701 Welch Road
-------
∂02-Oct-84 0923 CLT cafe
to chaotic at home - i fled
we could have coffee at the biz school if you come in
∂02-Oct-84 0902 RTC A CS206 Student writes
A TV CS206 Student asks you to please display any handouts on the monitor
so that they can know what they haven't got yet.
∂02-Oct-84 1009 STEELE@TL-20A.ARPA Quintus
Received: from TL-20A.ARPA by SU-AI.ARPA with TCP; 2 Oct 84 10:09:33 PDT
Received: ID <STEELE@TL-20A.ARPA>; Tue 2 Oct 84 13:10:34-EDT
Date: Tue 2 Oct 84 13:10:31-EDT
From: STEELE@TL-20A.ARPA
Subject: Quintus
To: jmc@SU-AI.ARPA
Are you planning to go to that shindig at Quintus on November 1?
According to their schedule you're moderating a session including
me and David Warren. RPG indicated you might be having doubts
about this thing, and I certainly have doubts about whether it
is really worth my time and trouble (I haven't made a firm
commitment to them yet).
-------
∂02-Oct-84 1033 DFH
Please call Bob Lachart (206) 775 1322 before noon today.
∂02-Oct-84 1121 DFH Speaker at today's luncheon
Dennis Bark office called to let you know that today's speaker is a
professor from Australia who is going to talk about The Australian Way
of Warfare.
∂02-Oct-84 1144 JMC*
NS lunch
∂02-Oct-84 1415 Allen.PA@Xerox.ARPA Re: Kurzweil
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 2 Oct 84 13:39:56 PDT
Received: from Burger.ms by ArpaGateway.ms ; 02 OCT 84 13:40:41 PDT
Date: 2 Oct 84 13:26:26 PDT (Tuesday)
From: Allen.PA@XEROX.ARPA
Subject: Re: Kurzweil
In-reply-to: JMC's message of 02 Oct 84 01:55 PDT
To: John McCarthy <JMC@SU-AI.ARPA>
cc: Spencer.PA@XEROX.ARPA, Diebert.PA@XEROX.ARPA, Allen.PA@XEROX.ARPA
Bill is out of town until next week (the reason for my replying). He is
available on Monday, 8 October. Could you come to PARC about 2:00?
Dorene
∂02-Oct-84 1511 @SRI-CSL:OPPENHEIMER@SRI-CSL.ARPA Oppenheimer resume
Received: from SRI-CSL.ARPA by SU-AI.ARPA with TCP; 2 Oct 84 15:10:21 PDT
Date: 2 Oct 1984 1509-PDT
From: Paul E. Oppenheimer <Oppenheimer at SRI-CSL.ARPA>
Subject: Oppenheimer resume
To: mccarthy at SU-AI.ARPA
cc: Oppenheimer at SRI-CSL.ARPA
Paul E. Oppenheimer
350 Tennyson
Palo Alto, CA 94301
415/326-9577
Professional goal: To work in the overlap of philosophy and AI.
Plan: Work in AI after completing my philosophy dissertation for
Princeton (on a classical topic in metaphysics, touching on some
issues in theoretical computer science), and seek a post-doc or
second PhD in AI.
What I'd like to work on now (after finishing dissertation):
Anything in natural language understanding, foundations of computation,
programming languages, knowledge representation, reflection & introspection,
human-computer interaction, CAI, or anything else that's interesting.
What I can do:
Think about hard problems. Have lots of ideas. Write lisp code. Work with
other people. Teach.
Education: PhD Candidate, Dept. of Philosophy, Princeton University
Work experience:
Currently, Summer Intern, Computer Science Lab, SRI International,
333 Ravenswood Avenue, Menlo Park, California 94025
April-July 1984, Independent Consultant on Artificial Intelligence,
Dallas, Texas
June 1983-March 1984, Software Designer, Computer*Thought Corp, Plano, TX 75075
September 1982-January 1983, Lecturer, Department of Philosophy,
Princeton University, Princeton, New Jersey 08544
June 1981, The Department of Philosophy Nominee for the Excellence in Teaching
Prize of the Association of Princeton Graduate Alumni.
February-June 1981, Assistant in Instruction, Department of Philosophy,
Princeton University.
Sptember 1978-June 1982, Princeton University Fellow.
June-August 1978, Instructor, Information Engineering Department,
College of Engineering, University of Illinois at Chicago,
Chicago, Illinois 60680.
September 1977-June 1978, Teaching Assistant, Department of Philosophy,
University of Illinois at Chicago.
September 1977-June 1978, University of Illinois Fellow.
May 1975-May 1976, Scientific Programmer, Heuristic Programming Project,
Computer Science Department, Stanford University, Stanford, California 94305.
May 1975-May 1976, Scientific Programmer, Institute for Mathematical Studies
in the Social Sciences, Stanford University.
May 1974-May 1975, Operations Research Programmer/Analyst,
Zayre Corporation, Framingham, Massachusetts.
February-May 1974, Technical Writer, self-employed, Atlanta, Georgia.
May-September 1973, Consultant, Computer Institute for Social Science
Research, Michigan State University, East Lansing, Michigan 48824.
May-September 1973, Programmer, Artificial Languages Lab,
Department of Computer Science, Michigan State University.
May-September 1972, Praktikant in Mathematics, Eidegenoessisches
Institut fuer Reaktorforschung, Eidgenoessische Technische Hochschule,
Switzerland.
May-September 1971, Teaching Assistant, Mathematics and Computer Science,
University of the New World, Switzerland.
September 1969-February 1974, National Merit Scholar, Lyman Briggs College,
Honors College, and Department of Mathematics, Michigan State University.
Student member of Dean's executive council.
Co-author of Provost's report on Lyman Briggs College.
May-September 1967, Summer Research Fellow, Michigan Cancer Foundation.
Designed and conducted own summer-long research project.
January 1966, Learned FORTRAN, Livonia, Michigan.
22 May 1953, Born, New York City.
------------------------------------------------------------------------------
In the Computer Science Laboratory of SRI International, I am part of a team
working on theory and tools for the formal specification and verification of
designs for computer systems (hardware and software, with an emphasis on
concurrent systems). Presently I am participating in the preliminary
discussion of the design of a decision procedure for temporal logic, to be
added to the existing proof checker. I have just designed and implemented
a proof debugging aid, and am documenting and augmenting it. I am also
designing a more advanced proof debugging aid. In addition, I am associated
informally with the Center for the Study of Language and Information at
Stanford University, where I am an active member of a seminar on
semantics of computation.
------------------------------------------------------------------------------
As an independent consultant on Artificial Intelligence in the Dallas area,
I helped my client set up an AI lab (including selection of a computing
environment), laid out a five-year plan for two research projects,
and gave courses in Lisp and Artificial Intelligence.
------------------------------------------------------------------------------
At Computer * Thought Corporation, I performed a variety of duties.
I did quality assurance for an Ada interpreter,
using Symbolics LM2s and EMACS, UNIX, VMS, and INGRES on VAXen.
This included designing and implementing
the software, procedures, documentation, and training for interpreter QA.
This also included developing an all-too-intimate acquaintance with
the syntax and semantics of Ada.
Prior to my assignment to QA duties (due to a change in the direction of
Computer * Thought's efforts), I was helping create a
curriculum for Intelligent CAI for software design methods and
Ada programming. During that period I was using mainly a
Symbolics LM2.
------------------------------------------------------------------------------
In the Information Engineering Department at the University of Illinois at
Chicago, I taught a data structures course (in which I had the students do
the programming portion in Lisp under Unix), and a course in artificial
intelligence.
------------------------------------------------------------------------------
At Stanford I contributed design and programming to the
EXCHECK Intelligent CAI project at IMSSS, which produced
the computer programs that teach the introductory logic and
set theory courses, and to the DENDRAL and CRYSTAL projects at
the Heuristic Programming Project.
------------------------------------------------------------------------------
------------------------------------------------------------------------------
Publication
"The Certainty of Skepticism", (with Ralf Meerbote),
Grazer Philosophische Studien, Volume 11 (1980).
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-------
∂02-Oct-84 1515 WASOW@SU-CSLI.ARPA NSF & university-industry collaboration
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 2 Oct 84 15:15:13 PDT
Date: Tue 2 Oct 84 15:01:54-PDT
From: Tom Wasow <WASOW@SU-CSLI.ARPA>
Subject: NSF & university-industry collaboration
To: researchers@SU-CSLI.ARPA
NSF has a program to encourage joint university-industry research projects.
This program is apparently being expanded, and may be a source for a
significant amount of additional funding for work some of us are engaged
in. Jon Barwise is going to Washington later this month to talk with
people at NSF about our research here, and he would like to bring with
him a list of actual or potential joint university-industry research
projects which might be candidates for NSF funding. If you are engaged
in such research, or if you have some ideas about a project you would
like to undertake, please let me know about it in the next two weeks.
I need, minimally, the following information:
Who would be involved
What the industrial partner would be
A brief paragraph describing the research project
A ballpark figure for the amount of money involved
(realistically, it should be in the $50k-$300k range)
I'll be trying to contact some people who I know are involved in such
research more directly, but my job will be made a lot easier if you
can contact me. I'm not asking for anything like full-scale proposals,
and you aren't making any sort of commitment by sending me a paragraph.
If you have ideas on this, PLEASE contact me about them promptly.
Tom
-------
∂02-Oct-84 1516 RA Reminder
You have a cocktail party today at 5:30 at the Hyatt Ricky's.
∂02-Oct-84 2306 MA Re: Abadi
[Reply to message]
Thanks for the trouble. I did not feel so strongly about going as to push--but
if you do not mind doing it, great. At any rate, Reiter just sent me an
invitation. Thank you very much.
Martin
∂03-Oct-84 1007 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 3 Oct 84 10:07:03 PDT
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Wed 3 Oct 84 09:55:47-PDT
Date: 03 Oct 84 0954 PDT
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
To: research@SU-CSLI.ARPA
Speaker: Larry Moss, C.S.L.I. Postdoctoral Fellow
Topic: Power set recursion, Part II
Place: Room 381-T, 1st floor Math. Corner, Stanford University
Time: Monday, October 8, 4:15-5:30 p.m.
S. Feferman
This is a continuation of the October 1 lecture.
PS - The electronic mailing list is in the process of development.
If you receive too many or not enoung copies of this announcement
please send complaint to CLT@SU-AI.
∂03-Oct-84 1055 RA
John Nafeh from Mad Computer would like you to call him @ (56) 943 1711.
∂03-Oct-84 1107 AAAI-OFFICE@SUMEX-AIM.ARPA Multilevel expert system workshop
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 3 Oct 84 11:07:37 PDT
Date: Wed 3 Oct 84 11:08:12-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Multilevel expert system workshop
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
I just talked to Jnausz Kowalik from Boeing regarding his request
for support for a workshop on multilevel expert systems.
Have you made any decision about it yet? If so, I'll send
him a letter with your decision.
-- Claudia
-------
∂03-Oct-84 1205 BLOCK@SU-CSLI.ARPA
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 3 Oct 84 12:04:53 PDT
Date: Wed 3 Oct 84 12:01:31-PDT
From: Ned Block <BLOCK@SU-CSLI.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 2 Oct 84 16:20:00-PDT
The whole idea is to have them accessible to non-linguists,
and see to it that the linguists present shut up.
-------
∂03-Oct-84 1348 RA
Anthony Trojanowski from BDM Corp, Mclean, Virginia would like you to call
him (703) 883 4734 re: their project of reasoning from uncertain
knowledge.
∂03-Oct-84 1549 RA
Lawrence Brothers, a student in CS206 would like to meet with you. Shall
I set an appointment? If yes, when, and if not, shall I just tell him to come by?
Generally speaking, do you want students to just come by, or do you want to be
more formal about it?
∂03-Oct-84 1608 KAHN@USC-ISI.ARPA Re: update on hep
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 3 Oct 84 16:08:22 PDT
Date: 3 Oct 1984 19:08-EDT
Sender: KAHN@USC-ISI.ARPA
Subject: Re: update on hep
From: KAHN@USC-ISI.ARPA
To: JMC@SU-AI.ARPA
Message-ID: <[USC-ISI.ARPA] 3-Oct-84 19:08:39.KAHN>
In-Reply-To: The message of 02 Oct 84 2140 PDT from John McCarthy <JMC@SU-AI.ARPA>
john,
thanks. incidentally, intel will be introducing its version
of the cosmic cube early next year. its based
on chuck seitz's design. cal tech is getting prototypes
in december and intel may announce their delivery
schedule in another month. its based on lots
of intel 286's (up to 128 of them per cube).
bob
∂03-Oct-84 1813 MOGUL@SU-SCORE.ARPA Student reps to facilities committee
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 3 Oct 84 18:12:20 PDT
Date: Wed 3 Oct 84 17:59:12-PDT
From: Jeffrey Mogul <MOGUL@SU-SCORE.ARPA>
Subject: Student reps to facilities committee
To: jmc@SU-AI.ARPA, bosack@SU-SCORE.ARPA
The current student representives to the Facilities Committee are,
besides myself,
Joe Weening
Jim DeLaHunt (JDLH@Score)
Would somebody see to it that they (we?) are put on the appropriate
mailing list?
-Jeff
-------
∂03-Oct-84 2132 BARWISE@SU-CSLI.ARPA The In-house Seminar
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 3 Oct 84 21:31:56 PDT
Date: Wed 3 Oct 84 21:22:32-PDT
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: The In-house Seminar
To: Research@SU-CSLI.ARPA
All,
The seminar committee tells me they are having a hard time getting
people to take an active part in the seminar, and that it might be
good to reminded people of what we decided about this seminar at an
open meeting last spring, when the advisory panel was here.
You will recall that last year we had two seminars each Thursday, as
well as TINLunch and the Colloquium. These were intended to get us
familiar with different fields. This year, though, the idea is for us
to have just one seminar, which everyone will take part in, in two
ways: by talking and by listening. The basic idea of the talks is
that they are to be on current or recent work, but explained to the
Center as a whole.
This will be the main Center wide function this year. Please help
make it a success by volunteering to speak, and by taking in active
part in the discussion that follows. In setting this up, we all
agreed that participation on a wide scale is crucial if we are to
build on the understanding we began to develop last year.
Thanks,
Jon
-------
∂03-Oct-84 2205 ARK Scherlis
To: JMC
CC: RPG, ARK
RPG says it is ok to put Scherlis in his office/desk. Can I go ahead with
it then? I'm working on getting you some more desks for 360.
Arthur
∂04-Oct-84 0414 @MIT-MC:rwg@SPA-NIMBUS Chudnovskys
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 4 Oct 84 04:14:00 PDT
Received: from SPA-RUSSIAN by SPA-Nimbus with CHAOS; Thu 4-Oct-84 01:29:45-PDT
Date: Thursday, 4 October 1984, 01:27-PDT
From: Bill Gosper <rwg at SPA-NIMBUS>
Subject: Chudnovskys
To: "jmc@SU-AI" at mc
Supersedes: The message of 27 Sep 84 02:11-PDT from Bill Gosper <rwg at SPA-NIMBUS>
I tried to CC you this msg to Holoway. It cam back with SU-AI not responding
-----
I may have mentioned these intense math-hacking brothers, who were
organizers of the NYU conference last april. They are in Columbia
math dept, but have no "ins" with cs dept, and are in desperate need
of algebraic computrons. They have access to a vax for file service,
but either can't afford Vaxima, or can't afford the vax time--maybe
JMC can tell us which. JMC is looking at trying to give them an
LM-2 that is still kicking around stanford, along with the chaos
board that used to connect it to a Stanford vax.
Do you think Symbolics would give them an LM-2 macsyma? Can you
imagine any way the LM-2 could get fixed if it breaks? Or is this
just a bad idea?
I really think it would be in Symbolics's interest to make these
guys win somehow, since they are truly amazing hackers who publish
prolifically and are widely known in the math community. It is
very likely that macsyma access will enhance their rate of significant
discoveries, and Symbolics could get some of the credit.
Any suggestions?
∂04-Oct-84 0416 @MIT-MC:rwg%SPA-NIMBUS@SCRC-STONY-BROOK [CWH at SCRC-TENEX: Macsyma in NYC]
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 4 Oct 84 04:14:16 PDT
Received: from SPA-RUSSIAN by SPA-Nimbus with CHAOS; Thu 4-Oct-84 03:53:57-PDT
Date: Thu, 4 Oct 84 03:51 PDT
From: Bill Gosper <rwg%SPA-NIMBUS@SCRC-STONY-BROOK.ARPA>
Subject: [CWH at SCRC-TENEX: Macsyma in NYC]
To: "jmc@sail"@MIT-MC.ARPA
Received: from SPA-RUSSIAN by SPA-Nimbus with CHAOS; Tue 2-Oct-84 14:05:28-PDT
Received: from SCRC-STONY-BROOK by SPA-RUSSIAN via CHAOS with CHAOS-MAIL id 55407; Tue 2-Oct-84 15:18:29-PDT
Received: from SCRC-YANGTZE by SCRC-STONY-BROOK via CHAOS with CHAOS-MAIL id 101246; Mon 1-Oct-84 15:02:26-EDT
Date: Monday, 1 October 1984, 15:01-EDT
From: Carl Hoffman <CWH at SCRC-TENEX>
Subject: Macsyma in NYC
To: RWG at SCRC-TENEX
cc: Ittai at MIT-MC
Message-ID: <841001150116.1.CWH@YANGTZE.SCRC.Symbolics>
Return-path: <Mailer@SCRC-TENEX>
Received: from SCRC-STONY-BROOK by SCRC-TENEX with CHAOS; Mon 1-Oct-84 10:49:12-EDT
Received: from MIT-MC by SCRC-STONY-BROOK via CHAOS with CHAOS-MAIL id 101024; Mon 1-Oct-84 10:49:25-EDT
Received: from NYU20 by CUCS20 with DECnet; 1 Oct 84 10:46:53 EDT
Date: Mon 1 Oct 84 10:46:51-EDT
From: Ittai Hershman <Staff.Hershman@NYU20>
To: CWH@MIT-MC.ARPA.Internet
Reply-To: Ittai@MC
BTW, your friend that was looking for a MACSYMA machine for two Columbia
mathematicians should contact CUCCA User Services to use MACSYMA on one
of their twenties (CU20B).
∂04-Oct-84 0822 BARWISE@SU-CSLI.ARPA Talk
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 4 Oct 84 08:22:46 PDT
Date: Thu 4 Oct 84 08:21:40-PDT
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Talk
To: McCarthy@SU-CSLI.ARPA
Thanks for the offer, John. I think it would be very good for you to
give such a talk, maybe 1/2 the informal part, then working into the
harder stuff on circumscription in the last 1/2. I told Meg Withgott
that you are willing, so she should be contacting you soon. Thanks
again. By the way, I have a draft of a paper on conditioals that I
should show you. I may talk about it in Maryland. Jon
-------
∂04-Oct-84 1042 cheriton@Pescadero Thoughts on HEP
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 4 Oct 84 10:42:34 PDT
Date: Thu, 4 Oct 84 10:41:30 pdt
From: David Cheriton <cheriton@Pescadero>
Subject: Thoughts on HEP
To: jmc@su-ai, rpg@su-si, ullman@diablo
I wrote the following to clarify my thoughts on the HEP which you
might find of interest. Basically what I distilled from HEP
papers that I found important.
(103 lines to follow)
ONE MAN'S VIEW OF THE HEP I
as distilled from Various Documentation by
David Cheriton
CSD Stanford University
Stanford, CA 94301
Oct. 3 1984
My preferred model of a (conventional low-level) parallel execution
environment is one that provides lots of inexpensive processes that execute in
parallel with access to shared memory and efficient synchronization and
minimal process switching overhead. I view this as an attractive
"machine-level" or assembly-language level environment in terms of which one
can implement higher-level parallel programming environments, such as
functional, dataflow and object-oriented languages.
It is my perception that the HEP provides essentially that model despite its
origins as a digital implementation of an analog computer. This is wonderful!
The question is: how well does it do this? The following is my list of basic
aspects of providing this model and my understanding of how the HEP does this
(and some guess at how well).
Multiple processes
The operating system and hardware provide up to 50 per processor and up to 16
processors, for a maximum of 800 processes in max. configuration. More
realistically, 150 processes with 3 processors is an interesting number of
processes but still a small enough number that we will find it a limitation in
some programs (my guess). I.e. as the HEP documentation says: they are a
scare resource.
Shared Memory
Each processor has access through a memory switch to a data memory module
shared among all processors. There is 100 ns delay per switch node and
variable number of switch nodes depending on number of processors. I was not
clear from doc. about exact memory reference times but looks like it could be
over 1 microsec. with 4 processors. Thus, a concern is data memory reference
time compared to conventional shared memory bus organization (like with
VMEbus).
Minimizing Memory Bus Bottleneck
I identified three basic techniques being used:
- separate per-processor program memory, separate from data memory.
Thus, processors do not contend on instruction fetch but each have
their own copy of the code. Good idea.
- Lots (2000) of general-purpose registers, with I presume are used in
usual fashion - fast local memory.
- Pipelined memory switch - I am shakey on this but - seems the switch
can handle multiple requests (at least from separate processors) at
once versus a shared bus which handles one at a time. I'm not sure
of the benefit derived although the memory switch is clearly more
expensive (isnt it?).
The big issue is: no cache other than the registers. Per-processor caches are
a popular thing. My guess is: if you use the registers WELL, not problem,
else the machine will slow down lots. I didnt see anything relating the
advertised 1.25 MIPS single stream and 10 MIPS 8 stream performance to level
of data memory references. It may be that that is with no data memory
references???
Efficent Process Switching
Each processor has up to 50 active program status words (PSW) with include PC
and other single stream info. Each processor has multiple register sets. The
processor (roughly speaking) switches between processes (PSW) on each new
instruction cycle, executing them round-robin except for PSW's that get queued
for data memory references in separate queue, returning when done.
Besides pushing the process switching cost to almost zero, this allows
considerably better pipelining in the processor than a single stream machine.
A winning design from what little I know about hardware.
Synchronization
Only form of process synchronization (as far as I can tell) is at the memory
word level with "asynchronous variables". All data memory and registers have
2 bits indicating full, empty or reserved. A fetch instruction can basically
suspend until a memory cell is "full" and a store instruction suspend until a
memory cell is "empty". Used in this way, a memory cell is basically a
communication channel, and seems like a concept from the days when the HEP was
to be a digital version of an analog machine.
This is clearly adequate for implementing all the standard synchronization
(like semphores, etc.) and also leads to some interesting examples programs,
like "self-synchronizing do-loops" and dataflow-like programming, i.e.
networking variables together with operations. The big question is: is this
overkill in synchronization and how expensive is it?
The suspension of a fetch operation is actually implemented as busy-waiting on
that memory cell. That is, the PSW whirls around the execution queue without
the PC being increment, reissuing the same data memory fetch until the cell is
available. Assuming the memory cell is in data memory (not a register), this
results in a memory request each time the PSW goes through the execution
queue. Besides wasting memory switch capacity, it slows down other processes
as well. That is, for more than 8 PSW's, the more there are, the slower they
go, even if some are "suspended" on empty/full variables.
I havent been able to determine from the documentation how much of a problem
this is. As a more specific scenario, suppose we write a program with 50
processes. At various times, only 8 are able to proceed. That means that 42
are waiting on asynchronous variables, namely busywaiting on data memory.
1. What is the effect on the speed of the other 8?
2. What is the difference depending on access patterns to registers
and data memory.
Note: writing programs so that almost all the processes are able to proceed
almost all of the time means understanding the program behavior in greater
detail compared to writing it as lots of processes and letting the machine
discover the parallelism as it runs.
One possible fix (if this busywaiting is a problem) would be to remove the PSW
from the execution queue if a variable is full/empty for too long and handle
the rest in software. This is a standard OS technique - busywait on a lock
for K cycles and then do a full process suspension. Alternatively, maybe some
equivalent of backoff in retrying the memory cell would help. (Of course, I
dont know the degree of the problem yet.)
In summary, the machine looks fairly reasonable to me. My major concerns are:
- the performance behavior of asynchronous variables.
- the hardware limited number of processes.
- the needs to use registers well in the absence of caches.
Hopefully, we can get some answers on these concerns in Denver.
∂04-Oct-84 1059 ARK Scherlis
∂04-Oct-84 0151 JMC
Say again what dates Scherlis will be here.
ARK - Mid Oct to Mid Dec, I understand.
∂04-Oct-84 1122 WITHGOTT@SU-CSLI.ARPA Talk on the 25th?
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 4 Oct 84 11:22:43 PDT
Date: Thu, 4 Oct 1984 10:03 PDT
Message-ID: <WITHGOTT.12052781098.BABYL@SU-CSLI.ARPA>
From: WITHGOTT@SU-CSLI.ARPA
To: JMC@su-csli.arpa
Subject: Talk on the 25th?
Cc: Meseguer@sri-ai, withgott@xerox
Barwise forwarded your message to me since I'm scheduling
speakers this quarter for the research seminar. Would
October 25 be a good date? The format we've adopted is for
the main speaker to give a presentation of around 45
minutes, and for a discussant to talk for around 15, leaving
15 minutes for the audience. The discussant is ideally from
CSLI. Because of this format, perhaps a combination of the
two talks you suggested would be ideal, if that is possible.
Meg Withgott
PS I've got some ideas for discussants if you draw a blank
there. For instance, if you choose to slant the talk more
to the technical side, de Kleer. In the less formal
colloquium later that day, we can schedule Hobbs to give a
report on his "commonsense summer."
∂04-Oct-84 1150 WITHGOTT@SU-CSLI.ARPA
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 4 Oct 84 11:50:49 PDT
Date: Thu, 4 Oct 1984 11:49 PDT
Message-ID: <WITHGOTT.12052800334.BABYL@SU-CSLI.ARPA>
From: WITHGOTT@SU-CSLI.ARPA
To: John McCarthy <JMC@SU-AI.ARPA>
In-reply-to: Msg of 4 Oct 1984 11:36-PDT from John McCarthy <JMC at SU-AI.ARPA>
Ok--Nov 15?
∂04-Oct-84 1358 RA
I left your plane tickets by your phone.
∂04-Oct-84 1446 RA
Rena Zanders from Fortune Mag. called, they are mentioning you in an article
they are writing. Would like to talk to you. (212) 841 4347.
∂04-Oct-84 1529 ucscc!beeson%ucscg.ucscc.UUCP@Berkeley thanks
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 4 Oct 84 15:29:29 PDT
Received: by UCB-VAX.ARPA (4.24/4.31)
id AA03047; Thu, 4 Oct 84 15:30:29 pdt
Received: from ucscg.UCSC (ucscg.ARPA) by ucscc.UCSC (4.12/4.7)
id AA26553; Thu, 4 Oct 84 15:19:35 pdt
Received: by ucscg.UCSC (4.12/4.7)
id AA28671; Thu, 4 Oct 84 15:19:33 pdt
Date: Thu, 4 Oct 84 15:19:33 pdt
From: ucscc!beeson%ucscg.ucscc.UUCP@Berkeley (20012000)
Message-Id: <8410042219.AA28671@ucscg.UCSC>
To: jmc@su-ai
Subject: thanks
Your participation in the panel discussion was much appreciated by
many people.
Should you have any more thoughts on the subject feel free to
communicate them.
I wonder if you have read Jonathan Schell's new book, "The
Abolition", in which he considers whether it is practical to achieve
a world without nuclear weapons, and what it would be like to live in
such a world. His point is that deterrence would still be in force;
instead of being deterred by weapons actually in existence, we would
be deterred by weapons which could be produced in a few months.
The net effect would be to change from a situation where we could
all be killed in half an hour to a situation where we could all be
killed in three months, which is much safer, not to mention cheaper.
The change in the social atmosphere in the world resulting from theλ
success of nations in negotiating such a change could be quite positive.
I am interested in your opinion about this; I find nothing in arguments
I have heard you make that would prevent your being in favor of
negotiating the abolition of nuclear weapons.
I fear that a world without nuclear weapons would be violently
unstable with respect to the possibility that some country could suddenly
produce them. Instead of the U.S. and the Soviet Union balancing their
relation, there would be a situation in which a dozen countries might
be in a position to dominate by jumping in first. Negotiating the
details of a ban and enforcing it would be very difficult. For example,
what stocks of plutonium or U235 would be allowed? What facilities
for isotope separation or facilities that could quickly be converted
to isotope separation? What groups that could quickly build the
high expolosive triggers for plutonium bombs?
I have no objection to abolishing nuclear weapons if it could
be done in a stable way, but I can't think of any scheme that would
be plausible. I haven't read Schell's book, but I read most of the
New Yorker version of his previous book, and he struck me as a wishful
thinker.
∂04-Oct-84 1530 RA interview
William Rus from MGM in LA would like to interview you regarding a movie
which they are doing. The name of the movie is: 2010. He'll call back
Monday.
∂05-Oct-84 0013 RPG
The mailing list whose mail appears under the heading:
∂05-Jul-84 2304 LAWS@SRI-AI.ARPA AIList Digest V2 #83
is placed in a file on SAIL for a few days stretch before being deleted.
Do you know where that is?
∂05-Oct-84 1017 RA Gordon Bell
Gordon Bell will be here Tueday and would like to meet with you. We sat
a tentative time for 10:00am Tuesday, Oct. 9. If this is inconvenient,
please let me know. He is at the ACM Conference. He will be at SF
Hilton Sat. and Sun. night 771 1400 and at Stanford Terrace Monday night 857 0333.
∂05-Oct-84 1225 RTC Common Lisp at Hewlett Packard
A student at HP asked about having common lisp ported to
their DEC-20's. Have you already asked Charles Hedrick
whether he agrees to this? Any other comments?
Ross
∂05-Oct-84 1253 RTC CS206 class size
To: JMC, GLB
CC: RA
I just counted 72 in-class students and 43 tv students (including auditors)
Ross
∂05-Oct-84 1324 JDM Key to offices containing lisp machines
John, Is it OK with you if I get a key to the offices containing the
lisp machines?
Jock
∂05-Oct-84 1346 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Announcing a new seminar.
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 5 Oct 84 13:41:17 PDT
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Fri 5 Oct 84 13:36:06-PDT
Date: 05 Oct 84 1318 PDT
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: Announcing a new seminar.
To: "@DIS.DIS[1,CLT]"@SU-AI.ARPA
Seminar on FOL: a mechanized interpretation of logic
presented by Richard Weyhrauch
Time: 4:15 to 6:00
Date: Alternate Tuesdays begining October 9
Place: Room 252 Margret Jacks Hall
The topic of this seminar is a description of FOL, a collection of structures
that can be used to provide a mechanized interpretation of logic. We will
present specific examples of interest for logic, philosophy and artificial
intelligence to illustrate how the FOL structures give formal solutions,
or at least shed light on, some classical problems. We will also describe
the details of FOL, a computer program for constructing these structures.
This provides a link between logic and AI.
Mechanization is an alternative foundation to both constructive and
classical logic. I have always found constructive foundations
unconvincing. Taken by itself, it fails to explain how we can understand
classical semantics well enough to make the distinction. Even more -- a
philosophically satisfactory account of reasoning must explain why in the
comparatively well behaved case of mathematical foundations the classical
arguments carry conviction for practising mathematicians.
On the other hand the use of set theoretic semantics also seems to require
infinite structures to understand elementary arguments. This conflicts
with the simple observation that people understand these arguments and they
are built from only a finite amount of matter.
Mechanization provides a semantics that is both finitist and at the same
time allows the use of classical reasoning.
∂05-Oct-84 1535 RA interview for Christian Science Radio
Jeffrey Chester @ 528 1320 from Christian Science Radio wants
to interview you for a radio program on AI. Are you willing?
∂05-Oct-84 1542 RA Did you reorder the textbook for CS206?
∂05-Oct-84 2122 ME Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 5 October 1984
Previous Balance 33.01
Monthly Interest at 1.5% 0.50
Current Charges 7.15 (vending machine)
-------
TOTAL AMOUNT DUE 40.66
Please deliver payments to Rutie Adler, room 358, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Bills are payable upon presentation. Interest of 1.5% per month will be
charged on balances remaining unpaid 25 days after bill date above.
You haven't paid your Pony bill since 2/84.
Accounts with balances remaining unpaid for more than 55 days are
considered delinquent and are subject to reduction of credit limit.
Please pay your bill and keep your account current.
∂05-Oct-84 2241 cheriton@Pescadero HEP Doc.
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 5 Oct 84 22:41:01 PDT
Date: Fri, 5 Oct 84 22:40:05 pdt
From: David Cheriton <cheriton@Pescadero>
Subject: HEP Doc.
To: jmc@su-ai, rpg@su-ai
I am under some obligation to return the HEP doc. I had with me
on the trip to Steve Lundstrom, so could I get it back in the next
week, please. I asked friend Fink about getting other sets of doc.
I would find it useful to have a set myself for students to refer
to (i.e. the "research" papers, not machine doc.). Anyone else
interested.
P.S. John, I did make the flight.
∂06-Oct-84 0900 JMC*
decter letter + reduction of prioritized + draft on editor based
∂06-Oct-84 1050 JJW HEP
To: Cheriton@SU-PESCADERO.ARPA, RPG@SU-AI.ARPA, JMC@SU-AI.ARPA,
Oliger@SU-NAVAJO.ARPA, Bosack@SU-SCORE.ARPA
A copy of the HEP Principles of Operation manual ended up in my papers
yesterday. I forget whose it is; please tell me if it is yours and you
want it back.
In what way should we communicate the possibility of getting this machine
to the department? The faculty can probably be told at the next faculty
lunch, if they haven't already, but most students are completely in the
dark on this. Does anyone object if I report on our visit at the next
student meeting, or at some other session in which we could present a
short technical overview based on our understanding of the machine? Or
perhaps we could get a Denelcor representative (e.g., Burton Smith) to
visit here, although he did so last spring, in a CSL colloquium.
I was kind of disappointed to hear that Denelcor doesn't have a simulator
for the architecture that we could use to play around with. They do
apparently have cross-assemblers and/or compilers that run on a VAX
though. Maybe we could get someone to write a simulator. I'm tempted
to do so myself, but it isn't a trivial project.
Joe
∂06-Oct-84 2328 SMC vet school narrative
Your suggestion sounds good, but what I really need to figure out is how to
make the whole thing better than O.K. (I agree that that is its current status).
I am willing to do any rewriing nessesary in order to improve it, this includes
scrappping the whole thing if I can find a better concept or method of
execution.Do you have any idea or suggestions?
∂07-Oct-84 1536 FEIGENBAUM@SUMEX-AIM.ARPA Re: Gordon Bell
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 7 Oct 84 15:36:22 PDT
Date: Sun 7 Oct 84 15:36:59-PDT
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: Gordon Bell
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 7 Oct 84 09:41:00-PDT
John, I'm tied up until about 10 or 10:30am. Where will you be meeting?
Ed
-------
∂07-Oct-84 1721 GOLUB@SU-SCORE.ARPA [John McCarthy <JMC@SU-AI.ARPA>: Gordon Bell ]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Oct 84 17:20:58 PDT
Date: Sun 7 Oct 84 17:06:18-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: [John McCarthy <JMC@SU-AI.ARPA>: Gordon Bell ]
To: JMC@SU-AI.ARPA
What's this about? The first sentence doesn't make sense.
GENE
---------------
Return-Path: <JMC@SU-AI.ARPA>
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Sun 7 Oct 84 09:43:13-PDT
Date: 07 Oct 84 0941 PDT
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: Gordon Bell
To: "@HEP.DIS[E84,JMC]"@SU-AI.ARPA
He is will tell us about Encore's product on Tuesday. It was originally
scheduled for 10am, but we are trying to move it to 9am to give a little
more time.
-------
∂07-Oct-84 2000 ullman@diablo Bell talk
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 7 Oct 84 20:00:44 PDT
Date: Sun, 7 Oct 84 20:01:41 pdt
From: Jeff Ullman <ullman@diablo>
Subject: Bell talk
To: jmc@sail
I have to go in to ACM on Tuesday.
Please extend Gordon my regards and apologies.
∂07-Oct-84 2002 GOLUB@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Oct 84 20:02:44 PDT
Date: Sun 7 Oct 84 20:01:44-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 7 Oct 84 17:25:00-PDT
When is this meeting? It came as a surprise to me.
GENE
-------
∂07-Oct-84 2006 BOSACK@SU-SCORE.ARPA Re: Gordon Bell
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Oct 84 20:06:14 PDT
Date: Sun 7 Oct 84 20:05:16-PDT
From: Len Bosack <BOSACK@SU-SCORE.ARPA>
Subject: Re: Gordon Bell
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 7 Oct 84 09:41:00-PDT
I was going to work at home most of Tuesday, but will come in for CGB's
talk.
Len
-------
∂07-Oct-84 2013 GOLUB@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Oct 84 20:13:43 PDT
Date: Sun 7 Oct 84 20:12:48-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 7 Oct 84 20:06:00-PDT
Sadly, I'll be out of town. How about bringing him to the lunch?
If you do, please announce it .
GENE
-------
∂07-Oct-84 2016 cheriton@Pescadero Re: HEP
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 7 Oct 84 20:16:07 PDT
Date: Sun, 7 Oct 84 20:14:54 pdt
From: David Cheriton <cheriton@Pescadero>
Subject: Re: HEP
To: Bosack@SU-Score, Cheriton@SU-PESCADERO.ARPA, JJW@Sail, JMC@Sail,
Oliger@Navajo, RPG@Sail
The HEP principles of magic was borrowed from Steve Lundstrom by me
and I do need to return. Please leave in my mailbox or give to secretary
in the next week.
I did ask one of the blue-suiters for more copies of the doc. so we
might have at least our own in CSD.
Regarding tech. presentation, I think it might be more appropriate to
give the students you own impression of the machine. I plan to update
my comments on the machine this week to reflect what I learned (that
is not top-secret) whereupon you are welcome to use that. The major
changes are: 1. async. variables are not a problem for performance on
single processor configs, but may clog message switches with multiprocessors.
2. limited program and data memory with no paging (just base-bounds mapping)
forces use of overlays for large programs -zoot suit computing.
Any other comments on what I wrote or how it should be revised would be
appreciated.
Gripe: I feel we could have been a lot better prepared. Most of what they
told us could have been extracted from the doc. without going to Denver.
I thought we were going to answer more detailed questions, which was why
I boned up on the machine, and was bored by much of the presentation.
Almost the only person worth talking to in my opinion was Tony Casaro (sp?),
who seemed pretty damn good.
∂07-Oct-84 2022 cheriton@Pescadero Re: Gordon Bell
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 7 Oct 84 20:21:55 PDT
Date: Sun, 7 Oct 84 20:21:00 pdt
From: David Cheriton <cheriton@Pescadero>
Subject: Re: Gordon Bell
To: JMC@SU-AI.ARPA
Yes, I teach a class at 11:00 am so 9:00 am would be much better.
Will he be here in body or just in conference call, or?
∂07-Oct-84 2152 MS modems
To: JMC
CC: MS
Thank you for the mail. SAIL has both 150/1200 modems and 1200-300 modems,
but as far as I know, Turing has only 1200-300 modems. I will try to
check about it.
I recently received a new version of Qute from Tokyo, and I have been
testing it on SAIL, Score and Turing. As Qute is written in DEC10 Prolog,
Qute runs on any of these computers. But each computer has its own problem.
SAIL: SAIL has Prolog 20 version 1.0.
Prolog on SAIL does not like the character '~'. Prolog exits when it
reads '~'. The effect of '~' is the same as that of '↑Z' on other
Prologs. I think that this is because the person who imported Prolog
on SAIL neglected the fact that the SAIL code for '~' is the same as
the ASCII code for '↑Z'. (Both are 032 in octal.)
I had to edit the source code for Qute and replace all the '~'s.
Score: Score has Prolog 20 version 1.1.
Prolog on Score does not allow you to save the state of a session.
In fact, you can save, but cannot restore it.
Turing: Turing has Prolog 20 version 1.3.
Turing has none of these problems. But, at present, I can use Turing
only through SAIL (or Score which also has 150/1200 modems).
I have directed some of these problems to restivo@score a few weeks ago,
but I have not yet received the reply.
∂07-Oct-84 2230 GENESERETH@SUMEX-AIM.ARPA
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 7 Oct 84 22:30:48 PDT
Date: Sun 7 Oct 84 22:31:34-PDT
From: Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 6 Oct 84 14:59:00-PDT
John,
When I arrive at PARC, whom do i ask for?
mrg
-------
∂07-Oct-84 2318 MS DM terminal
To: JMC
CC: MS
These days I have been using SAIL most extensively. There are many
reasons.
You can run Prolog as a subjob from within E. You cannot do this
from Emacs on Tops-20 (Score and Turing). The Unix Emacs on Russell
(A Vax750 at CSLI) can do this, but C-Prolog on Russell does not
have a compiler and is therfore very slow.
EKL, FOL, Ded, Tablog run on SAIL but not on other computers.
Reading SU-bboard from E is more convenient than reading it by
MM on Tops-20.
SAIL has a lot of unique programs like NS, SPIDER.
(So far I have successfully finished SPIDER only once. What is the
percentage of success for a skilful SPIDER player?)
For these reasons, I would like to continue to use DM terminal if possible.
(Moreover, since a DM terminal has the edit key, I found it more convenient
than a conventional termianl even when I use Emacs on Score.)
∂08-Oct-84 0800 JMC*
nsf, ohlander, ticket, Ross
∂08-Oct-84 0841 NILSSON@SRI-AI.ARPA Re: needed example
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 8 Oct 84 08:41:45 PDT
Date: Mon 8 Oct 84 08:41:37-PDT
From: NILSSON@SRI-AI.ARPA
Subject: Re: needed example
To: JMC@SU-AI.ARPA
cc: grosof@SUMEX-AIM.ARPA, LEP@SU-AI.ARPA, VAL@SU-AI.ARPA, NILSSON@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 7 Oct 84 18:57:00-PDT
A "resource-limited" reasoner using the closed world assumption
may fail to show that P(A) follows from the axioms--so it assumes
~P(A). Later, upon further thought (devoting more than the usual
amount of resources to the problem), it may be able to deduce
P(A) requiring retraction of ~P(A). A similar thing can happen
with Reiter's default logic. -Nils
-------
∂08-Oct-84 0851 NILSSON@SRI-AI.ARPA Re: preliminary remarks on your non-monotonic chapter
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 8 Oct 84 08:51:05 PDT
Date: Mon 8 Oct 84 08:50:46-PDT
From: NILSSON@SRI-AI.ARPA
Subject: Re: preliminary remarks on your non-monotonic chapter
To: JMC@SU-AI.ARPA
cc: genesereth@SUMEX-AIM.ARPA, NILSSON@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 7 Oct 84 19:07:00-PDT
Thanks for your comments. From the point of view of a typical CS
graduate student, I'm worried that circumscription is going to sound
pretty complex. That's why I thought we needed to introduce it in the
simplest setting possible--relating it to predicate completion--and
then gradually elaborate. But, we'll reconsider all of this in
light of your comments.
I'm still interested in hearing about your new approach to
prioritized circumscription. Maybe you'll be talking about it next
week at the workshop? -Nils
-------
∂08-Oct-84 0854 Spencer.PA@Xerox.ARPA Change of Plans for Kurzweil
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 8 Oct 84 08:54:40 PDT
Received: from Cabernet.MS by ArpaGateway.ms ; 08 OCT 84 08:54:28 PDT
Date: 8 Oct 84 08:55:00 PDT (Monday)
From: Spencer.PA@XEROX.ARPA
Subject: Change of Plans for Kurzweil
To: JMC@SU-AI.ARPA
cc: Spencer.PA@XEROX.ARPA, Allen.PA@XEROX.ARPA
John, evidently the Kurzweil scanner is down and can't be repaired until
next week. I'll ask Tim Diebert to reschedule your visit when things
are working.
Bill
∂08-Oct-84 1039 RA
How many copies of the book shall I order?
∂08-Oct-84 1057 MOGUL@SU-SCORE.ARPA Re: Subject: Zschau and Carnoy debate: Nuclear Weapons and National Security (from SAIL's BBOARD)
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Oct 84 10:57:17 PDT
Date: Mon 8 Oct 84 10:55:33-PDT
From: Jeffrey Mogul <MOGUL@SU-SCORE.ARPA>
Subject: Re: Subject: Zschau and Carnoy debate: Nuclear Weapons and National Security (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 5 Oct 84 21:32:00-PDT
Zschau has definitely displayed his bravery this year; after all, he
changed his votes on the MX missile and support for the Contras in
Nicaragua, once it became clear that his job was in danger. Not
that I disagree with his most recent votes on these two issues, but
I'm not sure I trust him to keep voting the same way next year.
-------
∂08-Oct-84 1130 RA reply to message
[In reply to message rcvd 08-Oct-84 10:59-PT.]
∂08-Oct-84 1136 RPG
To: JJW, JMC
∂08-Oct-84 1120 JMC ti
If we leave at 4pm, we'll be prompt. This might help get their attention.
On the other hand, they may be busy greeting people, and in this case it
would be better to go later. What do you think?
Let's leave here a bit after 4. Jow volunteered to drive. I know where it
is. Let's meet in JMC's office.
-rpg-
∂08-Oct-84 1230 minker@maryland LOGIC AND AI WEEK ABSTRACTS
Received: from MARYLAND.ARPA by SU-AI.ARPA with TCP; 8 Oct 84 12:29:49 PDT
Received: by maryland.ARPA (4.12/4.7)
id AA03725; Mon, 8 Oct 84 15:28:05 edt
Date: Mon, 8 Oct 84 15:28:05 edt
From: minker@maryland (Jack Minker)
Message-Id: <8410081928.AA03725@maryland.ARPA>
To: Barwise%su-csli.arpa@csnet-relay, JMC@SU-AI, Reiter.Ubc@csnet-relay.ARPA,
decvax\!watmath\!water\!mhvanemden@maryland, henschen@ANL-MCS.ARPA
Subject: LOGIC AND AI WEEK ABSTRACTS
FINAL ANNOUNCEMENT
WEEK
of
LOGIC and its ROLE in ARTIFICIAL INTELLIGENCE
at
THE UNIVERSITY OF MARYLAND
OCTOBER 22-26, 1984
The Mathematics and Computer Science Departments at the
University of Maryland at College Park are jointly sponsor-
ing a Special Year in Mathematical Logic and Theoretical
Computer Science. The week of October 22-26 will be devoted
to Logic and its role in Artificial Intelligence. The
titles and abstracts of the five distinguished lectures that
are to be presented are as follows:
Monday, October 22:
RAYMOND REITER (University of British Columbia)
LOGIC FOR SPECIFICATION: DATABASES, CONCEPTUAL MODELS
AND KNOWLEDGE REPRESENTATION LANGUAGES.
AI systems and databases have a feature in common: they
require representations for various aspects of the real
world. These representations are meant to be queried and,
in response to new information about the world, modified in
suitable ways. Typically, these query and modification
processes require reasoning using the underlying representa-
tion of the world as premises. So, it appears natural to
use a suitable logical language for representing the
relevant features of the world, and proof theory for the
reasoning. This is not the normal practise in databases and
AI. The representations used assume a variety of forms, usu-
ally bearing little or no ressemblance to logic. In AI
examples of such representation systems include: semantic
networks, expert systems, and many different knowledge
representation languages such as KRL, KL-ONE, FRL. In data-
bases, example representation systems are the relational
data model, and various conceptual or semantic models like
TAXIS and the entity-relationship model. The point of these
representation systems is that they provide their users with
computationally efficient ways of representing, and using
the knowledge about an application domain. The natural role
of logic in databases and AI is a language for specifying
representation systems. On this view, one must distinguish
between the abstract specification, using logic, of the
knowledge content of a database or AI application, and its
realization as a representation system. This distinction
has pleasant consequences:
1. The logical specification provides a rigorous
semantics for the representation system realizing the
specification.
2. One can prove the correctness of representation
systems with repect to their logical semantics.
3. By taking seriously the problem of logically speci-
fying an application, one discovers some rich and fas-
cinating epistemological issues e.g. the centrality of
non-monotonic reasoning for representation systems.
Tuesday, October 23:
JOHN McCARTHY (Stanford University)
MATHEMATICS OF CIRCUMSCRIPTION
Circumscription (McCarthy 1980, 1984) is a method of non-
monotonic reasoning proposed for use in artificial intelli-
gence. Let A(P) be a sentence expressing the facts "being
taken into account", where P stands for a "vector" of predi-
cates regarded as variable. Let E(P,x) be a wff depending
on a variable x and the Ps. The circumscription of E(P,x)
is a second order formula in P expressing the fact that P
minimizes lambda x.E(P,x) subject to the facts A(P). The
non-monotonicity arises, because augmenting A(P) sometimes
reduces the conclusions that can be drawn. Circumscription
raises mathematical problems similar to those that arise in
analysis in that it involves minimization of a functional
subject to constraints. However, its logical setting
doesn't seem to permit direct use of techniques from
analysis. Here are some open questions that will be treated
in the lecture.
1. What is the relation between minimal models and the
theory generated by the circumscription formula?
2. When do minimal models exist?
3. The circumscription formula is second order. When
is it equivalent to a first order formula?
4. There are several variants of circumscription
including successive circumscriptions and prioritized
circumscription. What are the relations among these
variants?
References:
McCarthy, John (1980):
"Circumscription - A Form of Non-Monotonic Reasoning",
Artificial Intelligence, Volume 13, Numbers 1,2,
April.
McCarthy, John (1984):
"Applications of Circumscription to Formalizing Common
Sense Knowledge". This paper is being given at the
1984 AAAI conference on non-monotonic reasoning and is
being submitted for publication to Artificial Intelli-
gence.
Wednesday, October 24:
MAARTEN VAN EMDEN (University of Waterloo)
STRICT AND LAX INTERPRETATIONS OF RULES IN LOGIC PROGRAMMING
The strict interpretation says only that is admit-
ted which is explicitly allowed by a rule. The lax
interpreta- tion says only that is excluded which is
explicitly disal- lowed. This distinction is impor-
tant in mathematics and in law, for example. Logic
programs also are susceptible to both interpreta-
tions. We discuss the use of fixpoint tech- niques
to determine Herbrand models of logic programs. We
find that least fixpoints and least models correspond
to the strict interpretation and characterize suc-
cessful finite computations of logic programs.
Greatest fixpoints and greatest models correspond to
the lax interpretation and are closely related to
negations inferred by finite failure and to terms con-
structed by certain infinite computations.
Thursday, October 25:
JON BARWISE (Stanford University)
CONSTRAINT LOGIC.
Constraint Logic is based on a semantics that grew out
of situation semantics, but on a syntax similar to
that from first-order logic. The sematics is not car-
ried out in set theory, as is usual in logic, but in a
richer theory I call Situation Theory, a theory about
things like situations, roles, conditions, types and
constraints. While the syntax is not so unusual look-
ing, the connection between the syntax and semantics
is much more dynamic than is in traditional logic,
since the interpretation assigned to a given *use* of
some expression will depend on context, in particular,
on the history of the "session". For example, vari-
ables are interpreted as denoting roles, but different
uses of a given variable x may denote increasingly
constrained roles as a session proceeds. This is one
feature that makes Constraint Logic interesting with
regard to AI in general and with regard to non-
monotonic logic in particular.
Friday, October 26:
LAWRENCE HENSCHEN (Northwestern University)
COMPILING CONSTRAINT-CHECKING PROGRAMS IN DEDUCTIVE DATABASES.
There are at least two kinds of formulas in the inten-
sional database which should always be satisfied by
the interpretations corresponding to the various
states of the database -- definitions and integrity
constraints. In our approach, formulas defining new
relations are used in response to queries to compute
portions of those defined relations; such formulas are
therefore automatically satisfied by the underlying
database state. On the other hand integrity con-
straints may need to be checked each time the database
changes. Of course, we believe there are significant
advantages in being able to express integrity con-
straints in a non-procedural way, such as with first
order logic. However, reevaluating an entire first-
order statement would be wasteful as normally only a
small portion of the database needs to be checked. We
present (resolution-based) techniques for developing
from first-order statements efficient tests for
classes of updates. These tests can be developed at
database creation time, hence are compiled, and can be
applied before a proposed update is made so that
failure does not require backing out.
Lectures will be given at:
MWF 11:00 AM - 12:30 PM
TTH 10:00 AM - 11:30 AM
Location: Mathematics Building, 3rd Floor Room Y3206
The lectures are open to the public. If you plan to
attend kindly notify us so that we can make appropriate
plans for space. We regret that all funds available to
support junior faculty and graduate students have been allo-
cated. For additional information contact:
Jack Minker
Department of Computer Science
University of Maryland
College Park, MD 20742
(301) 454-6119
minker@maryland
∂08-Oct-84 1233 RA file aaai.spe
As you requested last week aaai.spe is in [e84,jmc]
∂08-Oct-84 1338 SMC narrative
I did not think you meant to be critical, but I do think that "O.K. is
too appropriate. I want to find a way to make it better than that. If
you were on an admissions committee, what would you think of it? What
sort of thing answering those questions, do you think would be more
impressive?
∂08-Oct-84 1711 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 8 Oct 84 17:11:42 PDT
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Mon 8 Oct 84 10:34:14-PDT
Date: Mon 8 Oct 84 10:25:45-PDT
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: F4 meeting
To: f4@SU-CSLI.ARPA
cc: israel@SRI-AI.ARPA, sandy@SU-CSLI.ARPA
Project F4, "Mind, Action, and the Commonsense World" will have its
first meeting tomorrow (Tuesday, October 9) at 3:15 in the Ventura
conference room (do we have it reserved, Sandy?). This will be an
organizational meeting, so come prepared to talk about what you want
to do in this project. Ideas about how to use our regular meeting
time will be especially appreciated.
--Bob
-------
∂09-Oct-84 0800 JMC*
Chien
∂09-Oct-84 1007 RA renaming aaai.spe
I think we had a misunderstainding. The reason I put the file in [e84,jmc]
was because you asked me to do it in your mail of 10/2.
I left decter.1 on your desk.
∂09-Oct-84 1034 RA
I put the copy of the paper you wanted xeroxed on your desk.
∂09-Oct-84 1043 RA Interview with Bill Rus MGM
He called last week regarding interviewing you for a movie they are doing.
The guy called again. Do you want to see him today?
∂09-Oct-84 1110 RA
Cuthbert Hurd wants to meet for lunch with you and Nils @ Chantilly
Wednesday 11:30. If this is inconventient then Thursday or Friday at
noon. If this is no good then breakfast or dinner this week. This is
important because Nils will be away next week. Please let me know.
∂09-Oct-84 1330 RA
Bob Lackher from Denelcor wanted to let you know that he called.
∂09-Oct-84 1332 JJW Denelcor
To: JMC
CC: RPG
Bob Lacher of Denelcor just called me. He wanted to follow up on the
plan to send me out there with some code samples to test; this week
they apparently have one of the most instrumental HEP designers visiting
Denver from England, who would like to take part in this test.
He also told me that Burton Smith has been trying to reach you, to give
you this information as well as other things; and would like you to call
him back.
∂09-Oct-84 1342 minker@maryland Directions
Received: from MARYLAND.ARPA by SU-AI.ARPA with TCP; 9 Oct 84 13:41:53 PDT
Received: by maryland.ARPA (4.12/4.7)
id AA20994; Tue, 9 Oct 84 11:40:04 edt
Date: Tue, 9 Oct 84 11:40:04 edt
From: minker@maryland (Jack Minker)
Message-Id: <8410091540.AA20994@maryland.ARPA>
To: Barwise%su-csli.arpa@csnet-relay, JMC@SU-AI, Reiter.Ubc@csnet-relay.ARPA,
decvax\!watmath\!mhvanemden@Berkeley, henschen@ANL-MCS.ARPA
Subject: Directions
Cc: egkle@maryland, perlis@maryland
Dear Jon, Larry, John, Ray and Maarten,
I would just like to confirm that you all have reservations at:
The Quality Inn
US 1
College Park, Maryland
You can reach there as follows.
1. From Baltimore-Washington Airport
---------------------------------
You can get a limousine at a very reasonable rate that
will take you directly to the Quality Inn. The company
first takes you by bus and then transfers you to a
lomousine at Greenbelt, Maryland and takes you directly
to the Quality Inn. You have to tell them where you
want to go.
2. From Dulles Airport
-------------------
Take a limousine service to Silver Springs and then when
they leave you off you can take a taxi to the Quality Inn.
It will be less expensive than taking a taxi the whole
way since Dulles is a fair distance from College Park
(approximately 40 miles).
3. From National Airport (D.C.)
----------------------------
Take a limousine to Siver Springs and then a taxi to the
Quality Inn. A taxi from the airport might not be too
expensive since it is about 20 miles from the airport to
College Park. The limo followed by the taxi wil be less
expensive.
If you send me your plane arrival flight number and airport,
I will try to arrange
to have someone pick you up at the airport. I cannot guarantee that
this will happen since I am leaving for a week in Germany this
Friday and will arrive back home on Saturday. Don Perlis is attending
the Non-Monotonic Reasoning Workshop next week and may have difficulty
finding people to go to the airport. If you can respond today or at
the latest tomorrow with your schedule I might be able to make
arrangements this week to have someone meet you when you arrive.
I will meet you at the Quality Inn on Monday morning between 9AM and
9:30AM and drive you to my office. We can then go to the Math building
in time for the first lecture.
We plan to have a party in your honor inviting faculty and students
in AI on Monday evening. I will join you for dinner and we will
then go to Don Perlis' home at around 8 or 8:30PM. We are also getting
a block of tickets for the theatre on Tuesday. Don Perlis plans to
join you for dinner and then get you to the theatre afterwards. We
have made no plans for the rest of the week. I would have had a
second party at my home, but unfortunately my wife has not been
feeling well (no major problem), and it is not possible for us to
have everyone over. You will meet Rita at the theatre.
I look forward to seeing you all on October 22.
Best regards,
Jack
∂09-Oct-84 1432 JJW 206
What are the day or days that you want me to teach 206? Can we get
together sometime to discuss what topics to cover?
∂09-Oct-84 1643 RA
David Chudnovsky called will try and call later.
∂09-Oct-84 2229 cheriton@Pescadero Encore machine
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 9 Oct 84 22:29:38 PDT
Date: Tue, 9 Oct 84 22:28:36 pdt
From: David Cheriton <cheriton@Pescadero>
Subject: Encore machine
To: jjw@su-ai, jmc@su-ai, rpg@su-ai
Cc: cheriton@Pescadero
Sounded to me like the Encore machine, in the form useful to us/you
is a little further from reality than one would like. In particular,
some of National Semiconductor's problems could delay the thing into
an historical curiosity (exaggeration), and if time is of the essense
....
I think one would be safer waiting for the DEC Firefly workstation
as a multiprocessor machine than the Encore.
The machine is interesting from an engineering standpoint, at least
the highspeed bus, but has a lot of attributes that have been
dangerous in the past, namely:
1. Based on relatively unpopular processor (32032) that is trying hard
to catch up to popular ones (68000) but has got a tough battle.
E.g can 32032 compete with 68020??
2. Proprietary bus by small company. I didnt get a proper answer to
my question as to whether the Ethernet interface existed in Encore.
In general, peripheral-wise, one ould be at the mercy of Encore.
3. Oversimplified view of the software/performance issues, unless
people at Encore are wizards, or quoting longer time-to-completion
than Gordon is. Of course, "after the beginning of the year..."
is still true.
In general, it might be a nice machine (even bare hardware) if we could
get it soon, but I would hate to wait for it, and base a project on it
as the only machine.
I have this model that two good choices for Q-Lambda and even my work
would be one or both of:
* Pick a high-end machine like HEP or Cray IV and develop a system
that would be a performance standard against which others could
compare.
* Pick a medium/low-cost multiprocessor workstation like Firefly
or similar and aim for a system that the proletariat can afford
to buy and run like personal computers (or close to that model.)
(Of course, proletariat == average computer science dept.)
What I see as a loser currently is something in between: too
expensive as a workstation, too wierd and proprietary to be
widely used, not stellar in performance, and subject to delays
that might make it an "also-ran".
On the other hand, if one does not need to commit to a machine until
"after the beginning of the year", maybe it would look better then
∂10-Oct-84 0451 BARWISE@SU-CSLI.ARPA Wednesday Tea
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 10 Oct 84 04:51:27 PDT
Date: Wed 10 Oct 84 04:43:59-PDT
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Wednesday Tea
To: Researchers@SU-CSLI.ARPA
Don't forget that today's tea will be about plans for our long term
use of space at the Ventura site of CSLI. 3:30 at Ventura.
-------
∂10-Oct-84 0900 JMC*
chien
∂10-Oct-84 0914 JJW Comments on your comments
To: cheriton@SU-PESCADERO.ARPA
CC: JMC@SU-AI.ARPA, RPG@SU-AI.ARPA
I think one would be safer waiting for the DEC Firefly workstation
as a multiprocessor machine than the Encore.
I've never heard of the Firefly; that being a result of my own ignorance
of what currently exists. I think we're finding out that quite a few
companies are producing multiprocessors, and if we want to do a thorough
search, we will have to expand our view. Gordon Bell mentioned three
others (Synapse, Sequent and Sequoia), and the Elxsi has also come up in
conversation.
I didnt get a proper answer to
my question as to whether the Ethernet interface existed in Encore.
Before you arrived, he briefly described the I/O processor component
(of which there may be several) and flatly stated that it includes an
Ethernet interface.
Oversimplified view of the software/performance issues, unless
people at Encore are wizards, or quoting longer time-to-completion
than Gordon is.
Yes, he seemed to completely gloss over software issues.
I have this model that two good choices for Q-Lambda and even my work
would be one or both of:
* Pick a high-end machine like HEP or Cray IV and develop a system
that would be a performance standard against which others could
compare.
What's a Cray IV? Do you mean a Cray X-MP/4 (four processor Cray-1)
or a Cray-2 (which I think better models the future of multiprocessors)?
* Pick a medium/low-cost multiprocessor workstation like Firefly
or similar and aim for a system that the proletariat can afford
to buy and run like personal computers (or close to that model.)
(Of course, proletariat == average computer science dept.)
If you wanted to put together a 1000-processor system now or in the next
five years, I can't see how you would have any choice but to connect a
bunch of micros. So something like this seems more realistic, in terms
of ARPA's goals for the near future, than a multiprocessor based on
high-end technology.
∂10-Oct-84 0959 RA presentation at CIS sponsors meeting
Prof. Meindel from Elec. Enging.would like to give a presentation in
a meeting which will be held Nov. 14 and 15. He'll call back in about
an hour. His # 497-1013.
∂10-Oct-84 1003 BERG@SU-SCORE.ARPA textbooks for CS206
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Oct 84 10:03:17 PDT
Date: Wed 10 Oct 84 09:59:26-PDT
From: Kathy Berg <BERG@SU-SCORE.ARPA>
Subject: textbooks for CS206
To: JMC@SU-AI.ARPA
Stanford-Phone: (415) 497-4776
Unfortunately, the Common Lisp Manual is temporarily
out of stock. The publisher will be unable to furnish
the bookstore with additional copies until the end
of the first week in November. Would you still like
the textbook office to order 75 copies?
Please let me know.
Thanks,
Kathy
-------
∂10-Oct-84 1003 RA David Chudnovsky
Please call Chudnovsky at home within the next hour. His # (212)864 5320.
∂10-Oct-84 1023 JJW Test code for the HEP
To: RPG, JMC
Here are some thoughts on test code for the HEP. I've written a simple
length function, without procedure calls, and have a suggestion for a
more complex test.
1. Length of a list
This makes some assumptions about the format of assembler input,
since we don't yet have a reference manual for the assembler.
Variable registers Use
U pointer to current cons cell
X result of null test
LEN length of list
Constant registers Value
NIL representation of NIL
CAR 0 (offset of CAR given pointer) [not really needed]
CDR 1 (offset of CDR given pointer)
LENGTH .. function entry ..
CLR LEN ;length ← 0
B LENGTH2 ;unconditional branch
LENGTH1 INC LEN ;length ← length + 1
LODX U,CDR,U ;U ← cdr U
LENGTH2 TEQ X,U,NIL ;X ← if U=NIL then 1 else 0
BEQ X,LENGTH1 ;loop back unless U=NIL
.. function return ..
We could test it by initializing a region of data memory to contain a
list, and then executing code with a pointer to the beginning of it.
2. Finding the longest list
We are given a list of lists, e.g. ((A B C) (D C) () (D A B C)). The goal
is to return the longest one; in this case (D A B C).
One way to do this in parallel is to CDR down the first list and start a
process for each of the sublists that determines its length. It then
stores the length somewhere (where?), and we finish by CDRing down this
list, keeping track of the largest number so far, and simultaneously
CDRing down the original list again, so that we end up pointing to the
longest list.
a. How would you write this in QLAMBDA?
b. We could test this on the HEP without calling CONS, if we provide
a list for the processes to store the lengths in before creating
them. I'll work on the code for this later today unless you decide
to do it first.
The test should include lists that share storage, such as the one
above, to see how that affects performance.
Various ideas for using the full/empty bits come to mind for this
problem.
If we change it to finding the shortest list, then we can keep a
global variable SHORTEST-LENGTH-SO-FAR, and processes can die early
if their length is longer than it.
∂10-Oct-84 1044 SARASWAT@CMU-CS-C.ARPA Circumscription paper
Received: from CMU-CS-C.ARPA by SU-AI.ARPA with TCP; 10 Oct 84 10:44:42 PDT
Received: ID <SARASWAT@CMU-CS-C.ARPA>; Wed 10 Oct 84 13:41:47-EDT
Date: Wed 10 Oct 84 13:41:45-EDT
From: Vijay.Saraswat@CMU-CS-C.ARPA
Subject: Circumscription paper
To: jmc@SU-AI.ARPA
I wonder if it would be possible for you to send me a copy of your
paper:
"Applications of circumscription to formalizing common sense knowledge"
which you say has been submitted to Arificial Intelligence? (I am
quoting from the abstract of the talk you are to give at Maryland later
this month.)
If it is possible to retrieve it from SU-ai by an anonymous login, that would be the best (i.e. fastest) way of getting it for me.
Thank you, in advance.
Vijay A. Saraswat
-------
∂10-Oct-84 1155 RA David Chudnovsky
he called again. Please call him at home.
∂10-Oct-84 1202 RA
1. Prof. Samuel Bourn from Math Dept. UCB said you took his name for reprint
of your lecture at UCB and he has yet to get it. Do you have a reprint that
I can send him
2. Bill Russ from MGM called again.
∂10-Oct-84 1407 HANRAHAN@SU-SCORE.ARPA message
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Oct 84 14:06:58 PDT
Date: Wed 10 Oct 84 13:52:39-PDT
From: Katherine Hanrahan <HANRAHAN@SU-SCORE.ARPA>
Subject: message
To: McCarthy@SU-SCORE.ARPA
Stanford-Phone: (415) 497-2273
Call Richard Fateman from U.C. Berkeley 642-1879 Katie
-------
∂10-Oct-84 1450 RA
Please call Richard Fateman from UC Berkeley, 642 1879.
∂10-Oct-84 1540 RPG
To: JJW
CC: JMC
Like this:
(m-defun longest (l)
(let ((longest ())
(length-of-longest 0))
(labels ((monitor
(qlambda t (list len)
(cond ((< length-of-longest len)
(setq length-of-longest len)
(setq longest list)))))
(q-length
(lambda (list)
(do ((l list (cdr l))
(count 0 (1+ count)))
((null l)
(wait (monitor list count)))))))
(qcatch 'return
(do ((l l (cdr l)))
((null l) ())
(spawn (q-length (car l)))))
(list length-of-longest longest))))
(longest '((1 2 3)(1 2)(1 2 3 4 5 6 7)(1 2 3 4)(2 3 4 5 6 7) ()))
∂10-Oct-84 1711 JJW@S1-A.ARPA HEP etc.
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 10 Oct 84 17:11:22 PDT
Date: 10 Oct 84 1707 PDT
From: Joe Weening <JJW@S1-A.ARPA>
Subject: HEP etc.
To: jmc@SU-AI.ARPA
I just spent some time talking to Mike Farmwald, and mentioned the machines
that we have been looking at. He thinks that it would be a mistake to get a
HEP, and that we should consider Elxsi and Synapse, both of which are existing
multiprocessor machines.
Mike is willing (in fact, eager) to come to Stanford and talk about this, if
you want to hear his views. This Friday afternoon looks like a good time for
him. Is it for you?
∂10-Oct-84 2008 LUNDSTROM@SU-SIERRA.ARPA CIS Annual Review
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 10 Oct 84 20:08:28 PDT
Date: Wed 10 Oct 84 20:07:24-PDT
From: Stephen F. Lundstro <LUNDSTROM@SU-SIERRA.ARPA>
Subject: CIS Annual Review
To: jmc@SU-AI.ARPA
cc: meindl@SU-SIERRA.ARPA, lundstrom@SU-SIERRA.ARPA
John:
I am helping Jim Meindl setup the schedule for the CIS Annual Review.
We are waiting final word on room schedules at this time. Hope to have
that cleared up soon. Please let me know what times you are already
committed on 11/14 and 11/15. I am collecting this info from everyone and
will try to setup a master schedule that avoids conflicts. Hope to have
this all set by Friday latest. I will keep you posted.
Steve Lundstrom
-------
∂11-Oct-84 0200 SMC common.tex
I have finished "Programs with Common Sense". It is still in my area under
the name common.tex. I got it from [e80,jmc] when I went to copy it into
your area I discovered you already have file by that name. It appears to
be a version of the same paper, that someone was starting to convert to
tex. It has both tex and pub commands, it can probably be junked, but I
wanted to check with you first.
∂11-Oct-84 0911 RPG
To: JJW, JMC
(m-defun shortest (l)
(let ((shortest ())
(length-of-shortest ()))
(labels ((monitor
(qlambda t (list len)
(cond ((or (not (numberp length-of-shortest))
(> length-of-shortest len))
(setq length-of-shortest len)
(setq shortest list)))))
(q-length
(lambda (list)
(do ((l list (cdr l))
(abort () abort)
(count 0 (1+ count)))
((or (null l)
(and (numberp length-of-shortest)
(< length-of-shortest count)
(setq abort t)))
(cond ((not abort)
(wait (monitor list count)))))))))
(qcatch 'return
(do ((l l (cdr l)))
((null l) ())
(spawn (q-length (car l)))))
(list length-of-shortest shortest))))
∂11-Oct-84 1331 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 11 Oct 84 13:31:30 PDT
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Thu 11 Oct 84 13:20:45-PDT
Date: 11 Oct 84 1316 PDT
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
To: "@DIS.DIS[1,CLT]"@SU-AI.ARPA
Speaker: Lou van den Dries, Stanford Mathemathics
Topic: Limits of definable sets and functions
Place: Room 381-T, 1st floor Math. Corner, Stanford University
Time: Monday, October 15, 4:15-5:30 p.m.
S. Feferman
∂11-Oct-84 1426 RA
Prof. Barni Galler from University of Michigan called to talk to you
about the invitation to give a seminar in Japan next June. He'll be
at home until 4:45 (our time); would like you to call him. (313)668 8152.
∂11-Oct-84 1505 RA
Barnie Galler called again. He'll be home for another hour and a half.
∂11-Oct-84 1548 JJW Discussion
To: JMC@SU-AI.ARPA, pmf@S1-A.ARPA
RPG would like to join us tomorrow, but can't make it until about 3:30.
Should we reschedule?
∂11-Oct-84 1620 PMF@S1-A.ARPA Discussion
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 11 Oct 84 16:19:56 PDT
Date: 11 Oct 84 1619 PDT
From: Mike Farmwald <PMF@S1-A.ARPA>
Subject: Discussion
To: jjw@SU-AI.ARPA, rpg@SU-AI.ARPA, jmc@SU-AI.ARPA
∂11-Oct-84 1550 JJW@SU-AI.ARPA Discussion
Received: from SU-AI.ARPA by S1-A.ARPA with TCP; 11 Oct 84 15:49:50 PDT
Date: 11 Oct 84 1548 PDT
From: Joe Weening <JJW@SU-AI.ARPA>
Subject: Discussion
To: JMC@SU-AI.ARPA, pmf@S1-A.ARPA
RPG would like to join us tomorrow, but can't make it until about 3:30.
Should we reschedule?
Sure, it's 3:30.
∂11-Oct-84 1746 JJW Multiprocessor comparison
To: JMC@SU-AI.ARPA, RPG@SU-AI.ARPA, cheriton@SU-PESCADERO.ARPA,
Bosack@SU-SCORE.ARPA
I've prepared a file containing some comparative statistics for the
Denelcor HEP, TI Explorer, Encore, Elxsi 6400 and Synapse N+1 systems.
It is on SPECS[1,JJW] at SAIL. Some information is missing; please
send me a message if you can provide any corrections or additions.
Joe
∂11-Oct-84 1748 JJW HEP Lisp
This afternoon I visited Lucid and discussed HEP Lisp with them. We went
through a lot of issues, using the longest-list example. I think I know
enough now to turn it into reasonable HEP assembly code, that will test
some of the things that Lisp programs could be expected to do. It's going
to take at least another day or two for me to write the code.
∂11-Oct-84 1923 JMC Farmwald comments
To: "@HEP.DIS[E84,JMC]"@SU-AI.ARPA
Mike Farmwald of the S-1 Project at LLNL
will discuss the HEP and other parallel computers
at 3:30pm tomorrow. We'll start from my office.
∂11-Oct-84 2248 BRESNAN@SU-CSLI.ARPA NL2 activities this quarter
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 11 Oct 84 22:48:37 PDT
Date: Thu 11 Oct 84 22:40:41-PDT
From: Joan Bresnan <BRESNAN@SU-CSLI.ARPA>
Subject: NL2 activities this quarter
To: nl2@SU-CSLI.ARPA, iida@SU-CSLI.ARPA, l.megumi@SU-CSLI.ARPA
cc: lauri@SU-CSLI.ARPA, peters@SU-CSLI.ARPA, bresnan@SU-CSLI.ARPA,
: ;
NL2 is concerned with integrated theories of grammatical
information. That includes work on how morphology and syntax,
syntax and discourse, and syntax, semantics and intonation,
interface. It also concerns the foundational issues of what
syntax is, how grammatical information ties in with information
content, and the epistemology of linguistic structure.
This year there is a focus of special interest within
NL2 on the relations of morphology and syntax.
One of the most problematic properties of natural language is
the simultaneous modularity and interpenetrability of the lexicon
and the syntax. On the one hand, the internal constituency of
lexical words and of syntactic phrases is relatively independent,
or modular. This is supported by direct observations of ordering
constraints between morphemes and phrases, by studies in the
tradition of the "lexicalist hypothesis" (e.g. Chomsky and
Wasow), and most recently by the discovery that phonological
processes fall into lexical and postlexical classes, whose
domains are word-internal and phrase-level constituents,
respectively (Kiparsky, Mohanan). On the other hand, the
syntactic information carried by word structure deeply
interpenetrates that carried by phrase structure. For example,
objects, pronouns, and adverbial complements can be incorporated
into the internal word-structure of the predicates that govern
them, and governing predicates and operators similar in function
to verbs, prepositions, and quantifiers can be morphologically
incorporated into the objects or complements they govern. This
kind of interaction is present to some degree in all inflectional
languages in the form of agreement, although it is not restricted
to inflectional morphology alone.
Why is it that some phenomena respect the boundary between the
lexicon and the syntax, while other phenomena appear to ignore
it? How does grammatical information communicate between word
and phrase? What do these phenomena tell us about the overall
organization of grammatical structure? As a focus for work on
these questions, NL2 is sponsoring several activities. First
will be the Conference on Agreement this weekend (October 12-14)
at CSLI, which will bring together a variety of empirically and
theoretically oriented approaches represented by a number of
distinguished visitors to Stanford. Subsequently, we plan a
small, informal, "internal" workshop among NL2 participants to
attempt to consider the conference issues in relation to the CSLI
research program. Related activities are Paul Kiparsky's new
course on morphology to be given in the winter quarter in the
Linguistics Department, and the presence of a working group on
morphology, including Jerry Sadock, Gerald Gazdar, and David
Dowty, at CASBS.
Registration for the Agreement Conference is from 1:00 to 2:00 in
Ventura Hall on Friday, October 12. NL2 members are invited to
participate in the conference. After the conference we will have
an NL2 meeting to plan subsequent activities.
-------
∂11-Oct-84 2331 FEIGENBAUM@SUMEX-AIM.ARPA Re: Farmwald comments
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 11 Oct 84 23:31:37 PDT
Date: Thu 11 Oct 84 23:32:16-PDT
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: Farmwald comments
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 11 Oct 84 19:23:00-PDT
John,
I'm tied up in another meeting, but hope someone from my group will attend
(Harold Brown or Bruce Delagi).
Ed
-------
∂12-Oct-84 0849 CHEADLE@SU-SCORE.ARPA Russell Greiner's Oral
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Oct 84 08:49:47 PDT
Date: Fri 12 Oct 84 08:47:06-PDT
From: Victoria Cheadle <CHEADLE@SU-SCORE.ARPA>
Subject: Russell Greiner's Oral
To: faculty@SU-SCORE.ARPA
Office: Margaret Jacks 258, 497-1519
Just a reminder...I still have no one to be a 4th on Russell's oral committee.
It should be someone outside his area (AI). His Oral is Nov. 5th; all of this
is supposed to be decided by Oct. 15, the Grad Programs Office deadline for
Russell's Oral.
I would appreciate someone helping me out on this one.
Thanks...
Victoria
-------
∂12-Oct-84 0931 ullman@diablo Re: Farmwald comments
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 12 Oct 84 09:31:32 PDT
Date: Fri, 12 Oct 84 09:32:43 pdt
From: Jeff Ullman <ullman@diablo>
Subject: Re: Farmwald comments
To: "@HEP.DIS[E84, JMC@Sail, JMC]"@Sail
I teach until 4:15, but will drop by later.
∂12-Oct-84 1008 HULLMAN@SU-SCORE.ARPA annual report
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Oct 84 10:08:03 PDT
Date: Fri 12 Oct 84 10:03:57-PDT
From: Holly Ullman <HULLMAN@SU-SCORE.ARPA>
Subject: annual report
To: faculty@SU-SCORE.ARPA
cc: bscott@SU-SCORE.ARPA
I am planning to write the annual report using the information about
each faculty member that appears in Carolyn Tajnai's report on the
forum dated Sept. 1984.
-------
∂12-Oct-84 1106 HULLMAN@SU-SCORE.ARPA report
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Oct 84 11:05:52 PDT
Date: Fri 12 Oct 84 11:03:15-PDT
From: Holly Ullman <HULLMAN@SU-SCORE.ARPA>
Subject: report
To: faculty@SU-SCORE.ARPA
cc: bscott@SU-SCORE.ARPA
Sorry, I made a mistake and couldn't finish the message. What I
wanted to say was this. The file <tajnai>annual.mss contains
information about each of you for the forum report as of 9/84.
You can edit it yourself if there are any changes you wish to
make that you want to appear in the annual report I'm preparing
for January.
If you have received any special honors, awards, etc. please
let me know about them separately. My deadline for having
the report ready is early December.
-------
∂12-Oct-84 1135 @SU-SCORE.ARPA:ullman@diablo Tuesday Lunch
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Oct 84 11:35:40 PDT
Received: from diablo.ARPA (SU-AIMVAX.ARPA.#Internet) by SU-SCORE.ARPA with TCP; Fri 12 Oct 84 11:19:47-PDT
Date: Fri, 12 Oct 84 11:21:47 pdt
From: Jeff Ullman <ullman@diablo>
Subject: Tuesday Lunch
To: faculty@score
On the 16th we shall be visited by Frank Kuo of SRI.
The subject will be a joint Stanford/Berkeley/SRI center
for research into software and algorithms for massively
parallel computers.
∂12-Oct-84 1143 RA
Floyd Kelley from E Systems in Greenville Texas called, re: professional
user group of AI which is going to be in the city Nov. 5 or 6 wondered if you
would drive up #o talk to them. He said that he had talked to you in April and
you told him to call you in October. He'll call back around 1:00pm today.
∂12-Oct-84 1333 LIBRARY@SU-SCORE.ARPA New Chess Books in the Math/CS Library
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Oct 84 13:33:19 PDT
Date: Fri 12 Oct 84 13:30:07-PDT
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: New Chess Books in the Math/CS Library
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
The Joy of Computer Chess by Levy GV1449.3.L48 1984
The Chess Compouter Book by Harding GV1447.H36 1982
Comprehensive Chess Openings by Estrin and Panov
v.1 Open Games
v.2 Semi-Open Games
v.3 Closed Games
GV1450.E8313 1980 volumes 1,2,3
H. Llull
-------
∂12-Oct-84 1339 RPG Meeting
To: JMC
CC: JJW, CLT
Guy Steele, who is visiting me today, will sit in on the meeting and
give us his perspective as well.
-rpg-
∂12-Oct-84 1348 LIBRARY@SU-SCORE.ARPA New C Titles in the Math/CS Library
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Oct 84 13:47:51 PDT
Date: Fri 12 Oct 84 13:37:32-PDT
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: New C Titles in the Math/CS Library
To: su-bboard@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
C: an Advanced Introduction by Gehani QA76.73.C15G44 1984
The C Prgramming Tutor by Wortman and Sidebottom QA76.73.C15W67 1984
Understanding C by Hunter QA76.73.C15H86
H.Llull
-------
∂12-Oct-84 1401 LIBRARY@SU-SCORE.ARPA New Books in the Math/CS Library
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Oct 84 14:01:28 PDT
Date: Fri 12 Oct 84 13:50:11-PDT
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: New Books in the Math/CS Library
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
Parallel Programming in ANSI Standard ADA by Cherry QA76.6.C444 1984
Floating Point Systems, Inc. 1980 Users Group Meeting (8414279)
Floating Point Systems, Inc. Array Proceedings of the 1981 Conference (8414280)
First Scandinavian Conference on Image Analysis TA1632.S27 1980
Sources and Development of Mathematical Software by Cowell QA76.95.S68 1984
Local Area Networks by Gee TK5105.5G44 1982
Data Structures for Computer Information Systems by Ellzey QA76.9D35E44 1982
An Introduction to Automated Data Acquisition TS158.6.C57 1984
Data Structures by Reingold and Hansen QA76.9.D35R44 1983
APL a Design Handbook for Commercial Systems HF5548.5A23S62 1982
Wheels, Life, and Other Mathematical Amusements by Gardner QA95.G333 1983
H. Llull
-------
∂12-Oct-84 1429 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 12 Oct 84 14:29:18 PDT
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Fri 12 Oct 84 14:23:09-PDT
Date: Fri 12 Oct 84 11:03:25-PDT
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: next F4 meeting
To: f4@SU-CSLI.ARPA
cc: israel@SRI-AI.ARPA
The next meeting of the F4 project will be Tuesday, Oct. 23 at 3:15 in
Ventura. At the last meeting, we decided to begin the year by reading
the Gilbert Harmon's manuscript "Change in View." For the next
meeting, we will discuss the first two chapters, which is about 50
pages. Anyone who needs to get a copy of Harmon's manuscript should
let me know.
--Bob
-------
∂12-Oct-84 1439 AAAI-OFFICE@SUMEX-AIM.ARPA new scientist interview
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 12 Oct 84 14:39:24 PDT
Date: Fri 12 Oct 84 14:30:35-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: new scientist interview
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
I don't know how you feel about giving interviews now-a-days, but Ian Anderson
from New Scientist would like to ask your opinion about the 5th
Generation Project for a series of a feature articles on this
topic. I told him I'd ask you first before he called to make
any arrangements for an interview.
-- Claudia
-------
∂12-Oct-84 1558 GENESERETH@SUMEX-AIM.ARPA Re: electronic library
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 12 Oct 84 15:58:45 PDT
Date: Fri 12 Oct 84 15:59:35-PDT
From: Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>
Subject: Re: electronic library
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 12 Oct 84 14:13:00-PDT
Good news and I will talk with Richard when I get back
-------
∂12-Oct-84 1657 HANRAHAN@SU-SCORE.ARPA phone
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Oct 84 16:55:20 PDT
Date: Fri 12 Oct 84 16:51:56-PDT
From: Katherine Hanrahan <HANRAHAN@SU-SCORE.ARPA>
Subject: phone
To: faculty@SU-SCORE.ARPA
Stanford-Phone: (415) 497-2273
New phone books for Sept. 1984 (San Francisco, yellow and also white pages)
have arrived at the receptionist desk. Katie
-------
∂12-Oct-84 1716 CLT
did you know there is a uucp net site called dagobah?
∂12-Oct-84 1804 PB picking up sail costs
This is to remind you that you offered to pay half my sail costs, with me
personally picking up the other half. Also, I hope I made it clear that
my account hasn't yet been cancelled (as far as I have been told); I've
only been told to stop using it. Perhaps there will be enough flexibility
that I will be able to finish all my work before anything drastic happens,
in which case it won't be necessary for you to do anything. I'm really
grateful to you for being so helpful, especially since I can hardly claim
that there is any obligation to me.
--peter blicher
∂12-Oct-84 2128 GLB
Dear Prof.McCarthy, Jussi's file RAC.LSP[PRF,JK] contains Exarcise 5.1 pag.89
Chapter III of the book; my file EX.PRM[1,GLB] contains Exercises 5.2 and 5.3
More exercises will be ready soon. Also, according to a suggestion of Carolyn,
I plan to write a little report about the problems I have found in doing them.
∂14-Oct-84 2152 @MIT-MC:rwg%SPA-NIMBUS@SCRC-STONY-BROOK [H at SCRC-STONY-BROOK: [asb at SCRC-CUPID: [rwg at SPA-NIMBUS: Chudnovskys]]]
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 14 Oct 84 21:52:41 PDT
Received: by degas.Mit-chaos.Arpa (4.12/4.8) with CHAOS id AA13387; Mon, 15 Oct 84 00:53:36 edt
Date: Tue, 6 Jan 48 21:22 PST
From: rwg%SPA-NIMBUS@SCRC-STONY-BROOK.ARPA
Sender: rwg%SPA-NIMBUS@SCRC-STONY-BROOK.ARPA
Subject: [H at SCRC-STONY-BROOK: [asb at SCRC-CUPID: [rwg at SPA-NIMBUS: Chudnovskys]]]
To: jmc@SU-AI.ARPA
Supersedes: The message of 14 Oct 84 00:44-PDT from Bill Gosper <rwg%SPA-NIMBUS at SCRC-STONY-BROOK>
Date: Mon, 8 Oct 84 17:27 EDT
From: H@SCRC-STONY-BROOK.ARPA
Date: Mon, 8 Oct 84 15:12 EDT
From: Richard Brenner <asb@SCRC-CUPID.ARPA>
Date: Mon, 8 Oct 84 14:09 EDT
From: H@SCRC-STONY-BROOK.ARPA
This is probably in your camp?
Received: from SPA-RUSSIAN by SCRC-STONY-BROOK via CHAOS with CHAOS-MAIL id 97607; Thu 27-Sep-84 05:12:49-EDT
Date: Thursday, 27 September 1984, 02:11-PDT
From: Bill Gosper <rwg at SPA-NIMBUS>
Subject: Chudnovskys
To: h at SPA-NIMBUS
Cc: jmc at SU-AI
I may have mentioned these intense math-hacking brothers, who were
organizers of the NYU conference last april. They are in Columbia
math dept, but have no "ins" with cs dept, and are in desperate need
of algebraic computrons. They have access to a vax for file service,
but either can't afford Vaxima, or can't afford the vax time--maybe
JMC can tell us which. JMC is looking at trying to give them an
LM-2 that is still kicking around stanford, along with the chaos
board that used to connect it to a Stanford vax.
Do you think Symbolics would give them an LM-2 macsyma? Can you
imagine any way the LM-2 could get fixed if it breaks? Or is this
just a bad idea?
Since we no longer offer LM-2 MACSYMA, The MACSYMA part of this activity
would be fundamentally archaeological in nature. The MACSYMA component
of our costs would be far lower if we gave them a current 3600 version,
since we would not have to recreate it. Support of LM-2 MACSYMA would
also be prohibitively costly. I suspect that the same things could be
said about the System software and hardware, too.
I really think it would be in Symbolics's interest to make these
guys win somehow, since they are truly amazing hackers who publish
prolifically and are widely known in the math community. It is
very likely that macsyma access will enhance their rate of significant
discoveries, and Symbolics could get some of the credit.
Any suggestions?
∂15-Oct-84 0900 JMC*
Reason about rights.
∂15-Oct-84 0942 BERG@SU-SCORE.ARPA textbooks
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Oct 84 09:42:00 PDT
Date: Mon 15 Oct 84 09:39:15-PDT
From: Kathy Berg <BERG@SU-SCORE.ARPA>
Subject: textbooks
To: jmc@SU-AI.ARPA
Stanford-Phone: (415) 497-4776
Textbooks orders for winter quarter are due today. Please
give me a list of the books you would like the students to
purchase as soon as possible.
thanks
kathy
-------
∂15-Oct-84 0945 SF@SU-CSLI.ARPA clt reading committee
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 15 Oct 84 09:45:13 PDT
Date: Mon 15 Oct 84 09:42:09-PDT
From: Sol Feferman <SF@SU-CSLI.ARPA>
Subject: clt reading committee
To: jmc@SU-AI.ARPA
I think it would be best for Carolyn if there is no appearance of conflict
of interest for any mamber of her reading committee, either. Would it be
possible to get Manna to take your place on that too? I have no problem
about your being at the public part of the orals. I'm sure Carolyn would
welcome and credit any advice you would give her as an unofficial reader.
-------
∂15-Oct-84 0955 SF@SU-CSLI.ARPA reading comm.
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 15 Oct 84 09:54:27 PDT
Date: Mon 15 Oct 84 09:55:06-PDT
From: Sol Feferman <SF@SU-CSLI.ARPA>
Subject: reading comm.
To: jmc@SU-AI.ARPA
Fine. I overlooked that Manna was already on the reading part too.
I agree it would be good to get another member, and leave the choice to
your judgement.
-------
∂15-Oct-84 0958 CLT time for oral exam
To: SF@SU-CSLI.ARPA, ZM@SU-AI.ARPA, RWW@SU-AI.ARPA,
ULLMAN@SU-SCORE.ARPA, JMC@SU-AI.ARPA
I propose to schedule the exam for 2:30 pm on Tuesday Nov. 13.
That seems to be a time that the committee members can all attend.
∂15-Oct-84 1010 HANRAHAN@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Oct 84 10:10:27 PDT
Date: Mon 15 Oct 84 10:08:37-PDT
From: Katherine Hanrahan <HANRAHAN@SU-SCORE.ARPA>
To: McCarthy@SU-SCORE.ARPA
Stanford-Phone: (415) 497-2273
Federal Express in your mailbox..Katie
-------
∂15-Oct-84 1016 RA
The Polya paper is on your desk.
∂15-Oct-84 1018 RA
the two people for your 10:00 appointment are here waiting for you.
∂15-Oct-84 1204 JF@SU-SCORE.ARPA TGIF will happen!!
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Oct 84 12:04:51 PDT
Date: Mon 15 Oct 84 11:44:53-PDT
From: bureaucrat
Subject: TGIF will happen!!
Sender: JF@SU-SCORE.ARPA
To: students@SU-SCORE.ARPA, faculty@SU-SCORE.ARPA
Reply-To: JF@SU-SCORE.ARPA
peter karp and ramsey haddad said they would take turns buying and
laying out the food for t.g.i.f. because we already have a volunteer
for clean-up, that means we can go ahead and have t.g.i.f. i guess we'll
start this friday.
see you all there!
joan and marianne
-------
∂15-Oct-84 1345 JF@SU-SCORE.ARPA when and where is t.g.i.f.?
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Oct 84 13:45:24 PDT
Date: Mon 15 Oct 84 13:36:25-PDT
From: Joan Feigenbaum <JF@SU-SCORE.ARPA>
Subject: when and where is t.g.i.f.?
To: students@SU-SCORE.ARPA, faculty@SU-SCORE.ARPA
i have gotten some questions from first-years about where and when we
hold t.g.i.f. i believe it's 4:30 p.m., friday afternoon, in the little
room with a table off the third-floor lounge in margaret jacks. am i
right? and peter, ramsey, and arun: i hope you're out there listening!!
cheers,
joan
-------
∂15-Oct-84 1403 RA
Vicki from Gill Tours wanted to let you know that Mohonk is not currently
available for extended stay.
∂15-Oct-84 1404 RA your CV
Elyse from Quintas has problems getting your CV on line; she'd like me
to send her a hard copy. Which file can I find it in?
∂15-Oct-84 1507 RA
Les Ernest (or is it Earnest) called (408) 986 9400
∂15-Oct-84 1618 RA
Major Johnson called (513) 255 6730. Wants to visit you in order to talk
to you about your AI work.
∂15-Oct-84 1923 CLT
i phoned, but you werent there
λ∞bj5_∂∂Qhπβ"α∧∧@_L→ JJTε@@∩β⊃AYhR%βOD¬w.@→λ⊂⊃→P4w ah XAα#πeβ$¬vn@8πp∩otεP⊃β≤¬rε≡≥`∞&O<8 .9P⊂∩04∧AoQα+0⊗=Y4⊃λ<p
`"↓j πLD AQA∧E↓πX55_∂∂Q πεDλ @λLβ8∪5I↓& ∧π⊂≥7x∧l↓HA@ (β Kπv#'@≡ ↓8α
_∧)EJ↓α%∞∞W ∧~;H∞={9(∞∞Zw:λ9z0z→vrw:≤V⊂92Xwvx4[2r⊗⊂_w2⊂;XyP:w_q62P≥7FE9→qy2p]2P:4→P2y9≠y↔⊂⊂∩P40{→P0P3→rv4w→P:40]⊂$P6]yz⊂4_{2P9X{2r⊂_w⊂7v→εE;2\9twwλ7s⊂:~2P1wY2P7wλ9|y]λ1<P0Xqtr2[:↔⊂⊂∪2z⊂6YP5w7]P4s⊂≡wzP3Yz⊂:4~yFE2\97y⊂_sptw εEεE ∀P!9_w24yZ2r⊂≡O⊂190[22r↔λ⊂εEεB*40w~yP37\⊂:42H1wvvYw:9WβEεE⊗KP#90[5FEεBβπXZVSqz⊗\
⊂⊂→→LX∧`)UViagT"W i∀ ] i∩`)jVPdW i∀ P∧i→]⊂;t→w⊂0w→⊂;t2\2P4yH:↔3W~W3↔∨H⊂⊂εE∀2qrt]2r≥⊂→97vP∀jViaSi"W T( P1≡P)jVPdW i∀ P;t]4⊂*!T≥P⊂ZH'qz⊂∞~⊂⊂→ ]_X≥ X∧ PDTλ
∃%∃GK@'4∧V#R h M](⊂u%X0∧W T( P "y S@*5 ∞∞x∧Q%@ i ⊂A p∂@'$¬α¬⊂pλ≥H$¬`∨\α↓E@* xλnD∞λ
0∧d`)αP
'_¬0∩[A ⊂4T#π@&Tε@⊂ XD O@
h@`! ∧αβ∪$D ∪λ(""⊗B"
e←2 a∩π∩∞FG∞∧H∩l]∩∩(%R@q∪∧∧ZαNUl
%* _$∀λ↔BαH
SubbPK
Qiα∩ SB'⎇λH-D_;Q∀∞z∀∩i9P0h# ↓hU↑]" 3→8¬tλ∧∧RαU
V¬⊂⊂⊂∩#$C!T['π≡¬∩∃*&∩
∧λHTpg∧λλ∀P\∧qle↓;`∪Nα~
RM≤9p∀HTR0H(⊂P∀3Aauh !"∂∀¬≤UR4 !p "G0i( @(⊃$¬εαα
αV##KT⊃β"
ε*π|Xλ.M→8 :yP7 )`π@∃α∧≥f"π|≡&@Tε⊂;p¬ @↑β≠&Vrε ≡f(∧≥~_αH*#↓ @_A↑#⊃_GLd@⊂2:αf∪→λF`⊃&1_⊃ LB)((α∧
jh∞@∀04λDB↓↓Dλ
"jλ∩HE@D¬
b@)PP0⊃PHJ↓⊂⊗. ⊃ λDd↓PV∧! %,@T:$⊃!@*α$1≤ Fλ∀4!0)@b PYV(∧≡≤Q,D6w1∃S
c@,
π~
¬tHhp¬fhbiK` Mbβ⊂~VkHελ%7rP⊂∃edβ≥∧C;_"D∧⊂β≠`2@α∞#[' ⊂Tε∞vD∞6"_⊃@Gesd!S←]L\~∀~)β$b∪G+H4(hP0=E*j?∂QkAQ↓↓∪→ED'≡C?Vα,~2¬6dz∞VMt
JB¬JCπC/∪Mβ?rα∂'K∨+7O∂⊗KCS'}q↓↓hRK↔∂.K[↔⊃Rβ≠K?jαV∞2
j2>∞-→:εJ∧ β e¬~U6εJrεJB
β←'SBαR∞AZ↓EUα}≠Q↓a"↓↓IMS AiUBαB∩PhR∪πS+Q↓↓↓α↓↓↓↓α↓α7?ra↓EU∧{∂Q↓C!↓IIS!YiA"αB∩PhR≠K?kQ↓↓↓α↓↓↓↓α↓α∂#Ns≥6S∨+9α∂F{U↓s≡C?Vα,~2¬6dz∞VMt
JB¬ph*S=R↓↓↓↓α↓↓↓↓α↓↓α*l~αNUl
%:ε∃α∧4*≤→i↓↓α↓↓↓↓α↓↓↓↓ε≠#?ThROW V+∂Qiα↓↓↓↓α↓αCπε+KMβ}qα∂'⊗≠W7O∨∪'CSN{84(hR∪↔π∩αCK?2qα7∞≡ KS#KP4(4PJ%∨5ε β∨K∞#WπS*βOSW&+;QβNqαV∞d β7πV{K';:β'9α≥→9↓α⊗+∂↔;&ceα%ε;?P4W3↔KeεK;S↔⊗+OS↔"β'9βN{WIβN#↔¬β}1β∂'⊗≠W7O∨∪'CSN{9βπv!β'S~βπCCfK∂πSN{;Mβ&x4+∂}k7?9o≠↔;O*βK↔π≡{;';:q↓α /!βS#*β?;3JβCπC/⊃α%β≡{W3⊃ε3';⊃εKMβg␈+Iβπ↔#'∂3(h+'9π##∃α∂βK'1b↓Eeaαβ'OO.)β?→∧ KS'6K∂'πbα';S.c3'∨.s∂∃9αα∂?Wf!βg?*βC3↔∂≠∀4+&+31βn)β←#/∪∃α%ε≠π9β6K;⊃βn{K∃β&KO∂W∨≠'?;~β?9β≡KK∂Wo≠∂K'π#'?9bβ'84WβπKSN≠W3π∩aβπ;"β;?9nk?;?&{;'
εc?∨'~aβ'9ε;↔;↔⊗ 1↓⎇αα7eα
∩Bε:-!βπ∪'∪↔OMεKL4(hP%s∂F{VβW≡c¬73}≠WMxhP4+πv!β7eε ∪∪K/≠Mβ'_h(4(LkI9α≡C';≥m#OW9∧≠#?ThP& ?B↓QAab↓MAa¬;↔OS>{?⊃αεcπk∧hP&2¬bα∞¬↓K↓AIPhP4*g␈+Iβ/Ns⊃β#.cAβ←Nc1β *β∨K↔∂#3eβ∂βCK↔≡KπS↔"p4(4Ph($$HH&O'v≠↔K↔gI04(HH$$&≡C';≥m#OW9∧≠#?ThP$4)h(4(0=E*j?∂QkAQ↓↓∪→EP&T2αNUm~∞>J*rεJB
&K∃Rβ←#↔rβπ;⊃π;#↔K*β'Mβ"s≥;%v19⎇↓α↓↓↓hRK↔∂.K[↔⊃Rβ≠K?jαNU6≤~>J∃t
JB¬ε∪eαN*jε%:
∩B¬β>KS!α$~Am↓ )α?∂"↓aQ↓β⊃MiE#QAeα∧"P4*& S∃i∧k?9↓ )α?∂"↓aQ↓∪→iAES!A6B% 4*≠⊗{5iαV{π9α6+'∨↔v∪πW5βb*~α≥)6N∞⎇∩∃:ε∃α¬x4U≠W +.≠Qiα⊗)iβ←F+9βπv!β←#/∪∃β'~βQ;≥vI;→9z↓↓4U#=iα
∩.αN*jε%:
∩B∧4V≠
iβ∨#W∪↔w#NαN*jN∞>∀):εJ∧ 1β≠∞≠W3SLαNU6≤~>J∃t
JB∧hR'96⊗+C3em#=iαn+OOπ>)β≠K}i↓
π↔##WI∧[↔33/⊃↓rε∀ZαNUl
%:ε∃α¬y ε{→α7}q↓EU∧{∂Q↓C!↓IIS)YiAαjB∩PhP4+SF)βCK␈3'∪↔↔→β?→ε3??⊃bβ∪K'vYβπ;"β∂3↔∞q7WAπ;'31πβ?OQε β;?&K∂∃β∞∪?WPhS←#↔⊗)βS#*βQ;≥vI;→9π;'31ε∪∃β#.c⊃9↓εK→β;zβ≠WK&C↔Iβv{S'∂*β'Mβ>K[↔9bβ←∃β>K304V OOWn)β'Q?→β'9π##∃β&C'K⊃ε33??∩β3?Wv;∃84VS?π8hQ555ji544Ph(0=E2j?∂QkAQ↓↓β↓A@&
∩-↓O≠?KKJ↓↓↓hQ=E*j?∂QkAQ↓↓∪→E`&Tj
↓NSW;-εkπ'0hRπKSG+I1αJβ∪?9?!βπCπ∪↔∂'∂#∃βK.≠↔'[Ns≥βπfaβS#O→β+WvYβ7πNaβπ ␈+QαR<J→9↓∧C?\4V ?W"βWO'v9βS#*αJ⊗BeIβ≠↔∂#WK∃εk?K∃π≠CπKNs∨3eph(4*
∩-↓5∧Iβ∪?r;QβW≡)β¬α∀*B2eεkπ∂Kzq↓α%εCπK∪≡{∪∃βoIβK↔εc'↔Mr↓α%β6+3Qβ&CπQαJβO#?.c⊂4+⊗+C3eε 31β&yβS#O→β7↔∨≠π∨∃ε∪↔∂π/≠∃β?2βS#∃πβK? ∞∪'3''IβS#∂!β'Qεk'∨#"β ∃βF+3⊂4V{WSON#∃β'2βS#∃π;↔πSF+Iβ←/∪∃βO&K31βvK∂∃8hP4(0=E2j?∂QkAQ↓↓ ↓QD&dJ
Jε∃JαNUm~∞>J*rεJB
&;Wn+K'∂∞aαπ3>{K'SFkMα∨⊗{WAα&{∂W7.sSπSN{9↓hRK↔∂.K[↔⊃Rβ≠K?jαNU6≤~>J∃t
JB¬ε∪eαN*jε%:
∩B¬β>KS!α$~Am↓ 1α?∂"↓aQ↓β AiQ QEeα∧"P4*& S∃i¬#W∃↓ 1α?∂"↓aQ↓ ↓iM]S!U6B% 4*≠⊗{5iα~rM9>n S!αfK Kπ↔I↓r2L∩JεJLαNU6≤~>J∃t
JB¬ph*OW⊗S↔∂QRα;W7/∪'∂πbαπ3∨␈∪'S#o→α∨K␈+Aα∪}≠W7↔w#πS'}p4*S{QβOUn∪ ?π⊗"αNUm~∞>J*rεJBλh+∂
Rβ∨?3.∩αNUm~∞>J*rεJB
aβ≠π∨+3Sf¬~U6N≤zJ∃:
∩B∧4Ph*←∃εs?]βF [∃β&C∃α: 9α3'↔∪πKeε#?∂Wn+;Sπ&K?9βNqβS#*α7πSBz∞MαfK Kπ↔I94T3'[∃ε∪3π∂Zβ;?S.∪??/~βO#↔g3↔⊃β>KS!β&C∃β;}q7∂πfa7;Wn∪↔I5C!β ?}[M9↓∧B33Wf`4)5ji555hh(4(to Alex
Jacobson explaining why.
∂16-Oct-84 1045 RA
Les Ernest was here, he'll be in his office in about an hour and would like
you to call him.
∂16-Oct-84 1059 withgott.pa@Xerox.ARPA 11/15
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 16 Oct 84 10:59:10 PDT
Received: from Cabernet.MS by ArpaGateway.ms ; 16 OCT 84 10:58:15 PDT
Date: 16 Oct 84 10:58 PDT
From: withgott.pa@XEROX.ARPA
Subject: 11/15
To: JMC@SU-AI.ARPA
cc: withgott@SU-CSLI.ARPA, meseguer@SRI-AI.ARPA
|Nov. 15 is ok provided we can avoid
|1:15 to 2:30 when I teach.
Thank you very much for agreeing to give the seminar
on the fifteenth. While it usually starts at 2:15, we
can announce that it will start at 2:30 that particular
day.
Would you please send an abstract a week in advance
along with the name of the discussant? (We will send
tedious reminders asking same...) This is for the CSLI
newsletter.
Thanks again,
Meg Withgott
∂16-Oct-84 1129 @SU-SCORE.ARPA:KARP@SUMEX-AIM.ARPA TGIF
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 Oct 84 11:29:22 PDT
Received: from SUMEX-AIM.ARPA by SU-SCORE.ARPA with TCP; Tue 16 Oct 84 11:21:34-PDT
Date: Tue 16 Oct 84 11:23:29-PDT
From: Peter Karp <KARP@SUMEX-AIM.ARPA>
Subject: TGIF
To: students@SU-SCORE.ARPA, faculty@SU-SCORE.ARPA
Really, there is a very simple solution to the problem of finding
out where the TGIF will be held each week. At 4:30, go to either
the 3rd floor lounge or the grass in front of MJH, whichever is
easier. If the TGIF is not at the first place you try, go to the
other place and it will be there.
Those of you who wish can send me a solution for the problem of
N TGIFs being held at M different locations with P different types
of cheese being served. The person with the most elegant solution
can have my job.
-------
∂16-Oct-84 1155 JMC*
Earnest
∂16-Oct-84 1258 fateman%ucbdali@Berkeley a contact regarding the HEP
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 16 Oct 84 12:58:00 PDT
Received: from ucbdali.ARPA by UCB-VAX.ARPA (4.24/4.31)
id AA24575; Tue, 16 Oct 84 12:51:15 pdt
Received: by ucbdali.ARPA (4.24/4.38)
id AA25713; Tue, 16 Oct 84 12:58:55 pdt
Date: Tue, 16 Oct 84 12:58:55 pdt
From: fateman%ucbdali@Berkeley (Richard Fateman)
Message-Id: <8410161958.AA25713@ucbdali.ARPA>
To: jmc@su-ai
Subject: a contact regarding the HEP
Jim Mcgraw (mgraw@lll-crg) is knowledgable about the HEP and may be
able to help, according to a student (Russell Brand) here at Berkeley.
∂16-Oct-84 1347 RA
I went to a workshop. Be back around 4:45.
∂16-Oct-84 1428 KARP@SUMEX-AIM.ARPA
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 16 Oct 84 14:28:45 PDT
Date: Tue 16 Oct 84 14:29:01-PDT
From: Peter Karp <KARP@SUMEX-AIM.ARPA>
To: JMC@SU-AI.ARPA
cc: KARP@SUMEX-AIM.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 16 Oct 84 11:34:00-PDT
That was the purpose of my message, in case you didn't notice.
-------
∂16-Oct-84 1444 SMC funds
The funds that you asked for are in the top drawer of the safe. I also got
you a new credit card holder.
∂16-Oct-84 1500 JMC*
cal and phon
∂16-Oct-84 1720 @SU-SCORE.ARPA:WIEDERHOLD@SUMEX-AIM.ARPA Winter Quarter CSD Colloquium
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 Oct 84 17:20:49 PDT
Received: from SUMEX-AIM.ARPA by SU-SCORE.ARPA with TCP; Tue 16 Oct 84 17:18:58-PDT
Date: Tue 16 Oct 84 17:15:26-PDT
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
Subject: Winter Quarter CSD Colloquium
To: faculty@SU-SCORE.ARPA
Gene asked me to take care of CS300 during the Winter quarter.
Please let me know about any visitors you expect to have who are candidates
to speak. I hope to put an attractive program together which will attract
you to undertake the hike to Terman Auditorium.
Maybe have a trail of cookie crumbs?
Gio
-------
∂17-Oct-84 0759 BMOORE@SRI-AI.ARPA
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 17 Oct 84 07:59:39 PDT
Date: Mon 15 Oct 84 13:39:14-PDT
From: Bob Moore <BMOORE@SRI-AI.ARPA>
To: JMC@SU-AI.ARPA
cc: BMOORE@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 12 Oct 84 18:39:00-PDT
John,
I'll put a copy of the Harman manuscript in the ID mail.
--Bob
-------
∂17-Oct-84 1407 BARWISE@SU-CSLI.ARPA Come on, guys
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 17 Oct 84 14:07:34 PDT
Date: Wed 17 Oct 84 13:48:04-PDT
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Come on, guys
To: Research@SU-CSLI.ARPA
Tom sent out a request for a couple of paragraphs about any possible
projects that might involved people at Stanford with people in
indiustry, and has gotten only two, one he wrote. This is an
important thing, if I am to show NSF that the kind of work we are
doing is of interest to industry, which is part of what we need to do
to get major new money into NSF. It can also help in our short term
funding. IN short, it is a small amount of work but can have a big
payoff down the road. Please help if you can!
Jon
-------
∂17-Oct-84 1648 HOBBS@SRI-AI.ARPA Discussant
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 17 Oct 84 16:47:47 PDT
Date: Wed 17 Oct 84 16:46:53-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Discussant
To: jmc@SU-AI.ARPA
cc: hobbs@SRI-AI.ARPA
John --
I'll be giving a report on Commonsense Summer to CSLI on November 1, at 2:15.
The practice this year is to have a discussant for each colloquium talk.
Would you be willing to be the discussant for my talk?
-- Jerry
-------
∂17-Oct-84 1738 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 17 Oct 84 17:38:16 PDT
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Wed 17 Oct 84 17:35:17-PDT
Date: 17 Oct 84 1729 PDT
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
To: "@DIS.DIS[1,CLT]"@SU-AI.ARPA
Speaker: Prof. Justus Diller
Univ. of Munster, visiting U.C.Berkeley
Title: Inductive definitions and corresponding subsystems of analysis.
Place: Room 381-T, 1st floor Math. Corner, Stanford University
Time: Monday October 22, 4:15-5:30 p.m.
A no-host dinner will be arranged following the talk at some local
restaurant. Please let me know if you want to join this group.
S. Feferman
∂17-Oct-84 2341 COHN@SU-SCORE.ARPA photos are UP!
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Oct 84 23:41:18 PDT
Date: Wed 17 Oct 84 23:34:02-PDT
From: Evan Cohn <COHN@SU-SCORE.ARPA>
Subject: photos are UP!
To: faculty@SU-SCORE.ARPA
cc: students@SU-SCORE.ARPA
The photos are up on the third floor photo board. Take a look at
them. In looking at your own picture you might be overwhelmed by the
fact that the shot is fuzzy or you look like you were conked on the
head with a lead mallet. If this is the case, feel free to replace
the board photo with one of your own.
I was unable to identify one person. Make sure you have been
correctly identified. If not - change your name tag - BUT DON'T move
your picture - send me a note and I will correct all errors on the
24th.
In the past, people from the Southern Hemisphere have had their
pictures inverted. I don't understand this convention and have thus
decided to perpetuate it. Naturally you should feel free to
right/invert yourself in a manner contrary to custom. Just be warned
that even close friends won't recognize you if you do this. Not only
that but a tenth of thy kine shall perish. But I digress.
"What about the discontinuity in the middle ?" you ask. That is there to
allow for the correction of errors. It is presently filled with random
pictures chronicling department life.
If there are any complaints, send me (cohn@score) a note - I am a human
and am thus capable of dealing with complaints.
Evan.Cohn
-------
∂18-Oct-84 0655 BARWISE@SU-CSLI.ARPA NSF
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 18 Oct 84 06:55:19 PDT
Date: Thu 18 Oct 84 06:52:32-PDT
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: NSF
To: Research@SU-CSLI.ARPA
To fill in a bit on my "Come on" message, it is true that with respect
to this program, SRI collaboration doesn;t qualify, since SRI is not
for profit.
All we want at this point is a few paragraphs, a page at most, on each
possible project, sketching the sort of project, who the collaborators
would be, and what the industry connection is. I want a nice list of
such to hand out at my presentation at NSF next Tuesday. I leave
Sunday, so Tom needs them soon.
-------
∂18-Oct-84 1940 YM PhD Orals
To: JMC@SU-AI.ARPA, ZM@SU-AI.ARPA, RJW@SU-AI.ARPA
CC: Cheadle@SU-SCORE.ARPA
I want to schedule my orals for sometime in the second half of Novemebr.
Something like Tuesday 20 Nov or Wednesday 21 Nov will be good for me.
As a memebr of my reading committee you are expected to be on the orals
committee as well. Can you please indicate your day-date-time preferences?
Thanks,
Yoni Malachi.
∂18-Oct-84 2114 BRESNAN@SU-CSLI.ARPA Re: Come on, guys
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 18 Oct 84 21:14:38 PDT
Date: Thu 18 Oct 84 21:05:32-PDT
From: Joan Bresnan <BRESNAN@SU-CSLI.ARPA>
Subject: Re: Come on, guys
To: BARWISE@SU-CSLI.ARPA
cc: Research@SU-CSLI.ARPA
In-Reply-To: Message from "Jon Barwise <BARWISE@SU-CSLI.ARPA>" of Wed 17 Oct 84 13:48:25-PDT
Jon,
This is just to let you know that Paul Kiparsky and I are working
(with help from Ron Kaplan) on a joint Xerox-CSLI project
description on morphology and syntax interactions. I understand
that you need the final thing by Sunday a.m. at the latest.
Could you let me know if that is incorrect, or if there is
anything else we should know before you take it? We will be working
on it over the weekend.
Joan
-------
∂18-Oct-84 2125 BRESNAN@SU-CSLI.ARPA [ishikawa.pa@XEROX.ARPA: Re: [Stanley Peters <PETERS@SU-CSLI.ARPA>: ICOT interest in]
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 18 Oct 84 21:25:46 PDT
Date: Thu 18 Oct 84 21:20:14-PDT
From: Joan Bresnan <BRESNAN@SU-CSLI.ARPA>
Subject: [ishikawa.pa@XEROX.ARPA: Re: [Stanley Peters <PETERS@SU-CSLI.ARPA>: ICOT interest in]
To: peters@SU-CSLI.ARPA
cc: : ;
Return-Path: <ishikawa.pa@Xerox.ARPA>
Received: from Xerox.ARPA by SU-CSLI.ARPA with TCP; Thu 18 Oct 84 17:07:49-PDT
Received: from Riesling.ms by ArpaGateway.ms ; 18 OCT 84 16:03:30 PDT
Date: 18 Oct 84 15:38 PDT
From: ishikawa.pa@XEROX.ARPA
Subject: Re: [Stanley Peters <PETERS@SU-CSLI.ARPA>: ICOT interest in
CSLI's research]
In-reply-to: Joan Bresnan <BRESNAN@SU-CSLI.ARPA>'s message of Thu, 11
Oct 84 20:46:16 PDT
To: BRESNAN@SU-CSLI.ARPA
cc: kaplan.pa@XEROX.ARPA, ishikawa.pa@XEROX.ARPA
Stanley,
As you may already know, the person from ICOT who talked about his LFG
parser is Hideki Yasukawa. Toyoaki Nishida, who is now visiting Yale
Univ. , wrote a paper on a translation system using some mechanisms of
LFG. He will go back to Kyoto Univ. next year, where he has been
developing a translation system based on Montague Grammar with Prof.
Doshita. Fumio Mizoguchi, who is an associate professor at Tokyo
University of Science, has also great interest in all the items you
mentioned. He is teaching a subject called Cognitive Engineering and is
one of the people who founded Cognitive Science Society in Japan a few
years ago and a good friend of Mr. Fuchi at ICOT. Terry Winograd knows
him. Kenichi Murata, who is working for Fujitsu and a half-governmental
agency called IPA(Information Technology Promotion Agency(?)), has been
a key person who has organized various seminars on GPSG where Takao
Gunji is the chief lecturer. Akira Ikeya, who is now a visiting scholar
of our department, also knows details of the activities of the people
interested in GPSG. Hirosato Nomura, who is working at Musashino
Tsuuken of the Japanese counterpart of AT&T, showed great interest in
LFG when I went back to Japan last summer. Prof. Arata Ishimoto at
Tokyo University of Science is a logician who is interested in
Situational Semantics. I attended a seminar on Situational Semantics
organized by him and Dr Shirai(I can't recall his first name) at Keisuu
Koogakuka (Measurement Engineering(?)) of Tokyo University.
Akira
-------
∂19-Oct-84 0047 LLW@S1-A.ARPA Items
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 19 Oct 84 00:47:04 PDT
Date: 19 Oct 84 0041 PDT
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: Items
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA
John, I'm due to hassle the local Security Jefe Maximo on various items
this coming day, and I wonder if you've heard yet from the DoE Security
folks re your interview with them (as the local guy promised me several
weeks ago that this interview was imminent). Also, have you heard
satisfactorily from the Lab's Consulting Office yet? Lowell
∂19-Oct-84 0843 AAAI-OFFICE@SUMEX-AIM.ARPA Re: electronic library
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 19 Oct 84 08:43:19 PDT
Date: Fri 19 Oct 84 08:46:34-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Re: electronic library
To: JMC@SU-AI.ARPA
cc: AAAI-OFFICE@SUMEX-AIM.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 12 Oct 84 14:13:00-PDT
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
Have you talked to the powers that be about our access to the new computer
yet? I really don't want to talk to Len until we get their approval.
--Claudia
-------
∂19-Oct-84 0845 TAJNAI@SU-SCORE.ARPA IBM Reception
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Oct 84 08:45:37 PDT
Date: Fri 19 Oct 84 08:41:30-PDT
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: IBM Reception
To: Faculty@SU-SCORE.ARPA
cc: Tajnai@SU-SCORE.ARPA
IBM will be hosting a reception for CSD, CSL, CIS Faculty, Staff and
Students at the Faculty Club, Thursday, November 8 from 4 to 6 p.m.
Please mark your calendars. I hope you will be able to attend.
Carolyn
-------
∂19-Oct-84 0846 AAAI-OFFICE@SUMEX-AIM.ARPA Cross's proposal
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 19 Oct 84 08:46:02 PDT
Date: Fri 19 Oct 84 08:49:24-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Cross's proposal
To: JMC@SU-AI.ARPA, Bledsoe@UTEXAS-20.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Woody and John,
Has anyone contacted Stephen Cross about his proposal yet?
-- Claudia
-------
∂19-Oct-84 0921 LIBRARY@SU-SCORE.ARPA Availabilty of Socrates Accounts When You Have Need for One
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Oct 84 09:21:39 PDT
Date: Fri 19 Oct 84 09:16:54-PDT
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Availabilty of Socrates Accounts When You Have Need for One
To: su-bboards@SU-SCORE.ARPA
cc: : ;
So far we have given out 73 Socrates accounts from the Math/CS Library. I
want to assure those of you who haven't gotten accounts, that these accounts
will be available at anytime you determine you have a need for one. A number
of people have asked why an individual Socrates account is necessary. At
this point, many of you may find access to Socrates through the terminals
in the various libraries adequate. However as Socrates grows as a database
and as new services are added, you may want an individual account to access
the database for free at nights and weekends. For example, the technical
reports in the Math/CS Library will be included in an overall technical
reports file which will be searchable through Socrates. Exact date of
implementation has not been set but I hope it will be up during early 1985.
When the network is enlarged, more users of other systems will be able to
access Socrates from ITS through their terminals in their offices instead
of having to rely on dial-up procedures. Right now when searching Socrates
if you come up with a record that you can not interpret or refers you to
the reference desk, you can forward that record to us at Library@Score
and we will clarify the situtation, ie placing you on a waiting list if
the book is in the ordering procedure.
We will continue to have on hand a small number of account forms in the Math/CS
Library if you wish to get one. All other libraries on campus also have these
forms. If you have questions about Socrates, searching etc. feel free to
send them by E-mail or ask us while you are in the library.
Harry Llull
-------
∂19-Oct-84 0926 CLT money
To: SMC, JMC
∂19-Oct-84 0906 SMC
Carolyn, I have a problem with which I may need some help. I recently
ordered transcripts from Davis for Vet. School. They just sent me a notice
telling me that they wouldn't send them until I sent them money for an unpaid
bill. I didn't realize I owed them money. I don't know whether John would be
willing to pay for this, although I suspect he would. In any case I would
like to know if you could write me a check for it. If John wants me to I will
pay him back, but I need to send them a check immediately. Thanx.
------------------------------------------------------------------
I will write a check. You can come by the office and pick it up.
I need to know the amount. Then I can leave it on my desk
I case I am not here.
I will leave between you and John as to who pays in the long run.
∂19-Oct-84 0952 TW AI specialization in CS masters program
To: JMC@SU-AI.ARPA, TOB@SU-AI.ARPA, genesereth@SU-SCORE.ARPA,
buchanan@SUMEX-AIM.ARPA, feigenbaum@SUMEX-AIM.ARPA
CC: TW@SU-AI.ARPA, oliger@SU-SCORE.ARPA
I have had a couple of discussions with Joe Oliger about the problem
of Masters students wanting a concentration in AI. I have also had
a number of students asking me about it directly. My impression from
Joe was that there had been a specific decision not to do it when the
new program was set up, and I had been going on that basis. But after
a discussion with some students I realized I didn't see any good reason
for that policy and decided to check it out directly.
Therefore my question to you is, are there any good reasons not to simply
add an AI specialization to the regular masters program (in addition to
having the AI Masters as it is)? All that it would take is coming up
with a list of core courses and a list of optional courses to fill out
the requirements. It might increase enrollments in the AI courses slightly,
since the students who have come to talk with me have complained they
can't satisfy one of the other areas and still take all the AI courses
they want (especially people like the Bell students who have to finish
in one year). But given the overall enrollments, I don't think it is
a substantial difference. It seems that the AI masters is really a
different kind of program (aimed at training knowledge engineers and
tying in with HPP research), which does not (both because of its separate
admissions and its de-emphasis of academic content) satisfy the same
need as a regular Masters program with an AI specialization.
Unless there are objections, I will propose at the next meeting of the
Masters committee that we add the AI area and will get back to you with
a list of courses to be approved.
∂19-Oct-84 1036 HADDAD@SU-SCORE.ARPA TGIF indoors
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Oct 84 10:35:54 PDT
Date: Fri 19 Oct 84 10:17:23-PDT
From: Ramsey Haddad <HADDAD@SU-SCORE.ARPA>
Subject: TGIF indoors
To: students@SU-SCORE.ARPA, faculty@SU-SCORE.ARPA
Due to lousy weather, the TGIF today at 4:30 will be held in the
third floor lounge.
ramsey
-------
∂19-Oct-84 1036 RA dinner & reception at Hoover, Friday 11/02.
I put it in your cal. and RSVPed. If you don't want to go let me know
and I will cancel it. Carolyn said she doesn't want to go.
∂19-Oct-84 1051 RA you trip to UC Davis
Prof. Richard Walters of CS would like to meet with you at noon on 10/31 and take
you to lunch w/the CS Dept. The Philos. Dept. will meet with you for dinner. Do you
want to stay overnight? See letter from Lesley A. Byrns.
∂19-Oct-84 1501 JJW Sequoia systems
To: "@HEP.DIS[E84,JMC]"@SU-AI.ARPA
CC: EJG@SU-AI.ARPA
∂19-Oct-84 1303 JMB@S1-A.ARPA Sequoia systems
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 19 Oct 84 13:03:20 PDT
Date: 19 Oct 84 1130 PDT
From: Jeff Broughton <JMB@S1-A.ARPA>
Subject: Sequoia systems
To: jjw@SU-AI.ARPA
∂18-Oct-84 1831 CBF@MIT-MC Sequoia systems
Received: from MIT-MC.ARPA by S1-A.ARPA with TCP; 18 Oct 84 18:31:25 PDT
Date: 18 October 1984 21:33-EDT
From: Charles Frankston <CBF @ MIT-MC>
Subject: Sequoia systems
To: JMB @ S1-A
I went to a talk today about Sequoia (sp?) Systems. They are in
Chelmsford MA or the like, and claim to have a multiprocessor (up to 64,
apparently as high as 32) fault tolerant 68010 based system using dual
redundant high bandwidth buses. They also claim to have done their own
implementation (from scratch) of Unix (implements 4.2 and System V system
calls, or at least offers libraries you can call that do either) which is
fault tolerant. The hardware and the operating system is a symmetric
multiprocessor with shared memory.
The bottom line is that he described enough of how they do things that I
believe them. I.e. these guys went out and did what the Mark IIA claimed
it was capable of doing, and furthermore did what we didn't dare to do
with Amber. Albeit they had a lot of hardware assist. Anyway, you should
get me to tell you how they did it sometime, I don't feel like typing it
in right now..
∂19-Oct-84 1519 HADDAD@SU-SCORE.ARPA TGIF - correction
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Oct 84 15:18:57 PDT
Date: Fri 19 Oct 84 15:10:07-PDT
From: Ramsey Haddad <HADDAD@SU-SCORE.ARPA>
Subject: TGIF - correction
To: students@SU-SCORE.ARPA, faculty@SU-SCORE.ARPA
If there were weekly notices saying where TGIF's were, then
they would have to be made no later than the morning of the TGIF, so
that even people who read their mail infrequently would get a chance
to read it. If the decision on the location of the TGIF had to be
made in the morning, then it would have to be made on incomplete
weather information. If the decision was made on information that
turned out to be wrong, then it might be desirable to change the
location of the TGIF. If the location of the TGIF was changed, then
the notices would have been useless. Hence, weekly notices will not
be sent.
Effective immediately, people should use Karp's Algorithm for
determining the location of the TGIF.
ramsey
-------
∂20-Oct-84 1007 LIBRARY@SU-SCORE.ARPA Services by E-mail from the Math/Computer Science Library
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Oct 84 10:07:31 PDT
Date: Sat 20 Oct 84 10:04:44-PDT
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Services by E-mail from the Math/Computer Science Library
To: su-bboard@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA,
: ;
For those of you who are new and to remind everyone else, I encourage you to
use E-mail as a tool for using the library. We have found that certain
transactions can be taken care of through E-mail which save you time and
actually helps us regulate our workload. I have had some questions recently
as to what is appropriate to handle in this way. At this point we have just
a few ground rules when using E-mail to communicate with the library
that will help you and helps us.
1. Renewal of Materials: You may renew materials by electronic mail.
For books the call number is the most important data to send. For technical
reports, use the Math/CS Library accession number. For these materials you
do not necessarily need to include authro and/or title. If you do, it may
help but it is not necessary. With journals, you do have to include the
title of the journal, volume, year, and date. When we receive a list of
materials to renew, we follow through but do not respond back by e-mail
unless the book is needed by another patron, a call number is incorrect,
or if there is some problem we can not figure out. So when you send us
a list, assume everything is alright unless you hear otherwise. IMPORTANT:
ON ALL TRANSACTIONS BY E-MAIL PLEASE INCLUDE YOUR FULL NAME AND DEPARTMENT.
2. Recalls: If when you have checked out a book, you have included your
e-mail address along with your physical address, we will recall materials
from you by e-mail. This should save us time and (possibly) you money.
3. Request for Holds: If you need a book and you know it is checked out,
you can request by e-mail to be placed on a waiting list for that book.
Be sure to include your full name, and department when requesting.
4. New Book and Technical Reports Lists: When you see announcements of
new books and technical reports, you can send us a message to place your
name on a waiting list for the material when it begins circulating. New
Books are on display in the library for a week before circulating and
technical reports are usually on display for two weeks before circulating.
5. Reference Questions: Specific reference questions can be sent to us by
e-mail. Examples of such questions would be: I heard of a new journal,
do you have it, will you order?; I have a citation that says "to appear"
how do I find if/where this paper was published?; I am having trouble
finding information on a particular topic which has had very little written
on it, can you help?; I need some biographical information on someone
quickly, where do I look? We will respond to your reference questions
either with a specific answer, suggestions on how to approach the problem,
or if it appears to involve a lot of research, a suggestion to come by
the library so that we can get you started on the process.
6. Socrates Question: When searching Socrates at home or in your office,
if you come across a record you have a question about you can send us
the record and we will determine what the problem is. Usually it will
involve something on order and we can place your name of the waiting list.
These are some of the ways we can help you. You can help us by sending us
suggestions for new books or journals that you hear about. One thing
I would like to point out is that all the staff of the Math/CS Library
is involved in using the E-Mail for various services and procedures.
This includes our student assistants. So it is important that you
refer back to the original message when reponding to something we
have sent you. In addition, many of the messages dealing with
recalls etc. will be procedurally orientated. So if you get a
message concerning a recall and you know you have returned the book
or you have a question about policy or procedure you need to get
back to us and direct your question specifically to Larry Lim or
Harry Llull.
Harry Llull, Math/CS Library Library@SCORE
-------
∂20-Oct-84 2031 ATP.BLEDSOE@UTEXAS-20.ARPA Re: Cross's proposal
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 20 Oct 84 20:31:01 PDT
Date: Sat 20 Oct 84 22:30:21-CDT
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Re: Cross's proposal
To: AAAI-OFFICE@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA, Bledsoe@UTEXAS-20.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of Fri 19 Oct 84 10:47:15-CDT
Claudia,
Probably not (contacted Cross). I had thought we would get some
early advice on this from the Tenenbaum - Genesereth - Brauchman
committe, but I guess that was to optimistic. We may have to make an
ad hoc decision on this one. My first opinion would be to not sponson
it, or things like it, until we have a policy. But we should probably
ask TGB first for their opinion. It seems to me that they have
already said something about it, but I cant remember what.
-------
∂20-Oct-84 2035 ATP.BLEDSOE@UTEXAS-20.ARPA [AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>: Cross's proposal]
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 20 Oct 84 20:35:26 PDT
Date: Sat 20 Oct 84 22:35:12-CDT
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: [AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>: Cross's proposal]
To: aaai-office@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
I had not reread this message from you Claudia before sending my
previous message. In view of it I believe we not support their
conference. (And not bother TGB further about it not). OK?
Woody
---------------
Return-Path: <AAAI-OFFICE@SUMEX-AIM.ARPA>
Received: from SUMEX-AIM.ARPA by UTEXAS-20.ARPA with TCP; Thu 27 Sep 84 10:51:46-CDT
Date: Thu 27 Sep 84 08:51:39-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Cross's proposal
To: Bledsoe@UTEXAS-20.ARPA, JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Woody and John,
I agree with your comments about further consideration and thought
for this proposal, especially in light of the discussion about
splitting the NCAI into two conferences.
Let me give you some history about the IEEE-PAMI Applied AI
COnference. Last fall, Marty told Ron and I that the IEEE
was planning to have this conference at the same time
and location as our NCAI. Marty, Ron and I encouraged
Jake Aggarwal to move the conference to some other time,
which he did. We also discussed how we could help facilitate
their conference; we decided to sell them our mailling list
and allow them to advertise free in the magazine so that
our members could get a discount registration fee to their
conference. That is the limit to our involvement in this
conference (which frankly isn't much). I think we should
see how the IEEE experiment pans out before we proceed
with any decision to divide our conference.
What do you think?
---Claudia
-------
-------
∂20-Oct-84 2136 GOLUB@SU-SCORE.ARPA congratulations
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Oct 84 21:36:12 PDT
Date: Sat 20 Oct 84 21:33:35-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: congratulations
To: faculty@SU-SCORE.ARPA
Here is some exciting news. GENE
---------------
Return-Path: <kateveni@su-shasta.arpa>
Received: from su-shasta.arpa by SU-SCORE.ARPA with TCP; Wed 17 Oct 84 10:55:19-PDT
Date: Wednesday, 17 Oct 1984 10:54-PDT
To: golub at Score <golub@Score>
Cc: kateveni at Shasta <kateveni@Shasta>
Subject: 1984 ACM Doctoral Dissertation Award
From: Manolis Katevenis <kateveni@Shasta>
I had some good news, and I thought I'd let you know!
They notified me that I won the 1984 ACM Doctoral Dissertation Award.
Greetings,
Manolis.
-------
∂21-Oct-84 1117 SHAWN@SU-SCORE.ARPA AI track in MS--please respond!
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 21 Oct 84 11:17:25 PDT
Date: Sun 21 Oct 84 11:10:19-PDT
From: Shawn Amirsardary <SHAWN@SU-SCORE.ARPA>
Subject: AI track in MS--please respond!
To: faculty@SU-SCORE.ARPA
I am trying to make as much noise about starting an AI track in MSCS as
possible. I would truly appreciate any comments. Any messages sent to me
will be regarded as confidential unless you permit release to other
interested parties.
Thanks for your time --Shawn
-------
∂22-Oct-84 0919 FEIGENBAUM@SUMEX-AIM.ARPA [Bruce Delagi <DELAGI@SUMEX-AIM.ARPA>: [Andy Freeman <FREEMAN@SUMEX-AIM.ARPA>: [Glenn Adams <glenn@ll-xn.ARPA>: Re:
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 22 Oct 84 09:19:02 PDT
Date: Mon 22 Oct 84 09:22:19-PDT
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: [Bruce Delagi <DELAGI@SUMEX-AIM.ARPA>: [Andy Freeman <FREEMAN@SUMEX-AIM.ARPA>: [Glenn Adams <glenn@ll-xn.ARPA>: Re: Tightly-coupled multiprocessor UNIX]]]
To: jmc@SU-AI.ARPA
Mail-From: DELAGI created at 20-Oct-84 07:36:24
Date: Sat 20 Oct 84 07:36:24-PDT
From: Bruce Delagi <DELAGI@SUMEX-AIM.ARPA>
Subject: [Andy Freeman <FREEMAN@SUMEX-AIM.ARPA>: [Glenn Adams <glenn@ll-xn.ARPA>: Re: Tightly-coupled multiprocessor UNIX]]
To: nii@SUMEX-AIM.ARPA, brown@SUMEX-AIM.ARPA, feigenbaum@SUMEX-AIM.ARPA,
davies@SUMEX-AIM.ARPA, andy@SU-SCORE.ARPA, rpg@SU-AI.ARPA
Based on my work experience with Dave Rogers and Dave Schanin (the guy I
imagine who is responsible for the ideas in Encore's machine) the Sequent
machine seems worth knowing more about. (I mean no derogation of Schanin:
it's just that Rogers -- at least when I knew them both -- was the deeper
technically, ranged over a broader set of design issues, and had better
human interaction skills. If these qualities showed up in the design of
the Sequent, it's a machine we should understand better)......./bruce
---------------
Mail-From: FREEMAN created at 17-Oct-84 14:57:51
Date: Wed 17 Oct 84 14:57:50-PDT
From: Andy Freeman <FREEMAN@SUMEX-AIM.ARPA>
Subject: [Glenn Adams <glenn@ll-xn.ARPA>: Re: Tightly-coupled multiprocessor UNIX]
To: delagi@SUMEX-AIM.ARPA
Properly programmed, this may be a decent multi-processor simulator.
-andy
---------------
Return-Path: <unix-wizards-request@BRL-TGR.ARPA>
Received: from BRL-TGR by SUMEX-AIM.ARPA with TCP; Wed 17 Oct 84 14:49:57-PDT
Received: from ll-xn.arpa by BRL-TGR.ARPA id a006584; 17 Oct 84 16:45 EDT
Received: by ll-xn.ARPA (4.12/4.7)
id AA24683; Wed, 17 Oct 84 16:45:53 edt
Date: Wed, 17 Oct 84 16:45:53 edt
From: Glenn Adams <glenn@ll-xn.ARPA>
Message-Id: <8410172045.AA24683@ll-xn.ARPA>
To: david@COLUMBIA-20.ARPA
Subject: Re: Tightly-coupled multiprocessor UNIX
Cc: ted@COLUMBIA-20.ARPA, unix-wizards@BRL-TGR.ARPA
Dave,
I would call your attention to the recently released Balance 8000
system from Sequent Computer Systems, Inc., Portland, OR. They have taken
the 4.2BSD system and modified it extensively to operate in a tightly
coupled environment using a processor pool architecture. Their system uses
the 32XXX series of CPUs from National Semiconductor with the FPU and MMU
from that same series. In addition, they add an 8-KByte, 2-way, set
associative cache and a high speed 8 Kbyte local memory used for read-only
kernel data. Two autonomous CPUs are packaged per board with up to twelve
supported in the system. A custom VLSI chip, the System Link and Interrupt
Control (SLIC), handles interrupt handling contention and implements mutual
exclusion semaphores.
A distributed arbitration, 40 Mbyte/sec, synchronous bus (an enhanced VAX SBI?),
handles communication between processors, memory, a multibus adapter, and a
SCSI Bus Adaptor/Ethernet Module. A separate synchronous serial bus ties each
SLIC together, each unit on the main bus possessing a SLIC.
Software-wise, you get a 4.2BSD system with its Virtual Memory system completely
replaced with one of Sequent's design. A new model was employed in its design
that results in processes paging against themselves, rather that against the
system at large, etc.
Their performance figures show near linear performance up to the full complement
of twelve processors over a variety of benchmarks. They are currently shipping
with 10Mhz 32016's (half a VAX750), but soon hope to be using the 32032 as soon
as they can get reliable, i.e., full temperature range, chips from National.
With the latter, the system is fully worth a dozen VAX750s.
If some of the above sounds VAXEN like, or an improvement thereof, it is
probably due to their V/P of engineering, Dave Rogers, who was on the VAX780
architecture team at DEC.
Personally, I am going to watch this company carefully. I think they have a
handle on a good architecture and have did all the leg work to produce a
working system. If there is anything lacking, it may be the limitations (!?!)
of the 4.2BSD network system in producing a viable networked file-system.
However, given that multiplexor files are still warm in the grave, I think
that a lot can be done with the generic network architecture in the 4.2BSD
implementation. This reflects little on Sequent's system and I urged Mr. Rogers
to continue in the same vein and add a good networked file-system on to the
Balance 8000.
For further information, see Electronics Design, September 6, 1984, pp. 153-168.
Glenn A. Adams
glenn@LL-XN.ARPA
MIT - Lincoln Laboratory
-------
-------
-------
∂22-Oct-84 1112 RA Expo 85 seminar
Galler (313) 764 9595 wants to know which of the two topics you would
like to talk about:
1) New Generation Systems
2) The quality and Role of Computer Science Education.
∂22-Oct-84 1253 RESTIVO@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Oct 84 12:53:48 PDT
Date: Mon 22 Oct 84 12:52:14-PDT
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
[cwr] have been trying to get ahold of Professors Boyer or Moore to
find out more about school possibilities at UTA. their office
phone [512 4711901] hasn't elicited a reply in some while.
would you offer any suggestion or number for opening this dialog?
-------
∂22-Oct-84 1420 JDM 3600 in RPG's office
The screen looks like it has waves runing down it. I called
Symbolics and they need a purchase number before they can send a field
rep over. Who should I get the number from?
Jock
∂22-Oct-84 1437 @SU-SCORE.ARPA:ullman@diablo Parallel Computation Center
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Oct 84 14:37:40 PDT
Received: from diablo.ARPA (SU-AIMVAX.ARPA.#Internet) by SU-SCORE.ARPA with TCP; Mon 22 Oct 84 14:33:28-PDT
Date: Mon, 22 Oct 84 14:34:58 pdt
From: Jeff Ullman <ullman@diablo>
Subject: Parallel Computation Center
To: faculty@score
Following up on the lunchtime discussion with Frank Kuo, I
am trying to crystalize Stanford interest in the joint
SU/SRI/UCB center for multiprocessor software.
The intent is for the center to support one or more large
multiprocessors, perhaps much more than any of the three institutions
could support by itself.
We are going to try to interest NSF in an initiative to fund this
center, including both an initial hardware purchase and research
support. As part of that effort, we would like to show NSF the
kind of activities that people at the three institutions would
be able to perform if the center existed.
While I may have to go around beating on doors later, I would
like to start with a public call for expressions of interest.
At this point, a letter (preferably hardcopy, but electronic is OK)
with a few sentences about the general area of research that
interests you would be appreciated.
The advantages to participants include:
1. The opportunity for easy access to some interesting machines.
2. Support for some students and/or research associates if the
proposal is successful.
The cost is that if we go ahead with the proposal, each participant
will have to expand that letter into 5-10K bytes describing the
proposed research in detail. This will be needed before the end of
1984.
∂22-Oct-84 1733 @SU-CSLI.ARPA,@SU-SCORE.ARPA:BMOORE@SRI-AI.ARPA [Bob Moore <BMOORE@SRI-AI.ARPA>: next F4 meeting]
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 22 Oct 84 17:33:20 PDT
Received: from SU-SCORE.ARPA by SU-CSLI.ARPA with TCP; Mon 22 Oct 84 17:30:57-PDT
Received: from SRI-AI.ARPA by SU-SCORE.ARPA with TCP; Mon 22 Oct 84 17:30:29-PDT
Date: Mon 22 Oct 84 17:31:33-PDT
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: [Bob Moore <BMOORE@SRI-AI.ARPA>: next F4 meeting]
To: f4%su-csli@SU-SCORE.ARPA, ingrid%su-csli@SU-SCORE.ARPA
Don't forget the F4 meeting tomorrow (Tuesday). My apologies if you
get this message twice, but the mail system has been having problems,
and I think my first attempt to send this failed.
---------------
Return-Path: <@SU-SCORE.ARPA:BMOORE@SRI-AI.ARPA>
Received: from SU-SCORE.ARPA by SRI-AI.ARPA with TCP; Fri 12 Oct 84 14:37:38-PDT
Received: from SU-CSLI.ARPA by SU-SCORE.ARPA with TCP; Fri 12 Oct 84 14:27:22-PDT
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Fri 12 Oct 84 14:23:09-PDT
Date: Fri 12 Oct 84 11:03:25-PDT
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: next F4 meeting
To: f4@SU-CSLI.ARPA
cc: israel@SRI-AI.ARPA
The next meeting of the F4 project will be Tuesday, Oct. 23 at 3:15 in
Ventura. At the last meeting, we decided to begin the year by reading
the Gilbert Harman's manuscript "Change in View." For the next
meeting, we will discuss the first two chapters, which is about 50
pages. Anyone who needs to get a copy of Harman's manuscript should
let me know.
--Bob
-------
-------
∂23-Oct-84 0910 CHEADLE@SU-SCORE.ARPA University grading policies
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 Oct 84 09:10:34 PDT
Date: Tue 23 Oct 84 09:07:54-PDT
From: Victoria Cheadle <CHEADLE@SU-SCORE.ARPA>
Subject: University grading policies
To: faculty@SU-SCORE.ARPA, instructors@SU-SCORE.ARPA
Office: Margaret Jacks 258, 497-1519
I have recently been informed by the Registrar's office that it is against
University policy to change a low grade (such as a C or D) to an NC after the
original grade has been recorded. The student usually wants this done so that
a low grade will not appear on his/her transcript. The University feels that
by allowing students to drop classes up until 24 hours before the final, that
this policy is both reasonable and fair. Grade cards with these kinds of
changes are routinely being returned to the departments by the Registrar.
Victoria
-------
∂23-Oct-84 0916 BARWISE@SU-CSLI.ARPA Wednesday's Tea
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 23 Oct 84 09:16:47 PDT
Date: Tue 23 Oct 84 09:13:42-PDT
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Wednesday's Tea
To: Research@SU-CSLI.ARPA
"What are all these philosophers doing around here?"
Wednesday, Oct 24, Tea, 3:30, Ventura
Recently a reporter from the LA Times called me. She majored in
philosophy once up on a time. In doing some research for a series on
Hi Tech and AI, she was amazed at the number of philosophers involved
around California. "Why?" she asked. What should I have said?
We have discussed the role of psychology and computation in our
research. Now its your turn to give it to the philosophers.
Linguistics, logic and AI will get their turns.
-------
∂23-Oct-84 1127 TAJNAI@SU-SCORE.ARPA [Brent Hailpern <BTH.YKTVMX%ibm-sj.csnet@csnet-relay.arpa>: wine and cheese]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 Oct 84 11:20:07 PDT
Date: Tue 23 Oct 84 11:17:00-PDT
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: [Brent Hailpern <BTH.YKTVMX%ibm-sj.csnet@csnet-relay.arpa>: wine and cheese]
To: Faculty@SU-SCORE.ARPA
Thought you might be interested in some of the "IBMers" who will be
coming to the wine and cheese party (reception) scheduled at the
Faculty Club for Thursday, Nov. 8 from 4 - 6 p.m. This is a party
and IBM is paying all the expenses.
Carolyn
---------------
Return-Path: <BTH.YKTVMX%ibm-sj.csnet@csnet-relay.arpa>
Received: from csnet-relay by SU-SCORE.ARPA with TCP; Tue 23 Oct 84 10:07:16-PDT
Received: from ibm-sj by csnet-relay.csnet id al04432; 23 Oct 84 12:52 EDT
Date: 23 Oct 1984 10:51:58-EDT (Tuesday)
From: Brent Hailpern <BTH.YKTVMX%ibm-sj.csnet@csnet-relay.arpa>
To: tajnai%su-score.arpa@csnet-relay.arpa
Subject: wine and cheese
Here is my list of IBMers coming to the wine and cheese party.
There will probably be some late additions.
YORKTOWN
Addanki, Sanjaya
Hailpern, Brent
Hoevel, Lee
Paul, George
Sabbah, Danny
SAN JOSE
Finkelstein, Shel
PALO ALTO
Mendelsohn, Noah
-------
∂24-Oct-84 0918 MDIXON@SU-CSLI.ARPA lisp programming & proving typo
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 24 Oct 84 09:18:44 PDT
Date: Wed 24 Oct 84 09:17:12-PDT
From: Mike Dixon <MDIXON@SU-CSLI.ARPA>
Subject: lisp programming & proving typo
To: jmc@SU-AI.ARPA
Reply-To: MDixon@SCORE
on page 23 of chapter 3 you have the equation \omega↑x=x, which i believe
should be \omega↑x=\omega. .mike.
-------
∂24-Oct-84 1143 BMOORE@SRI-AI.ARPA research activities
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 24 Oct 84 11:43:44 PDT
Date: Wed 24 Oct 84 11:41:48-PDT
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: research activities
To: bratman@SU-CSLI.ARPA, pcohen@SRI-AI.ARPA, georgeff@SRI-AI.ARPA,
konolige@SRI-AI.ARPA, jmc@SU-AI.ARPA, bmoore@SRI-AI.ARPA,
nissenbaum@SU-CSLI.ARPA, john@SU-CSLI.ARPA, stan@SRI-AI.ARPA,
zalta@SU-CSLI.ARPA
This message is being sent to everyone who is officially on CSLI
project F4, "Thought, Action, and the Commonsense World." The
executive committee has asked for a report on what actual research is
going on in each project, so could you each please send me a few
sentences about what research you are doing that falls under this
project. Those who are receiving salary support through CSLI should
take this very seriously, since there will have to be budget cuts next
year, and I would not want to be in the position of not having claimed
to be doing any research when those decisions are made. To refresh
your memory, the following is the "official" description of the
project:
Project F--4. Thought, Action, and the Common Sense World
A premise underlying this project is that theories of thought, action
and the common sense world cannot be profitably developed
independently of each other. Language is a type of action that
expresses thought and, at the same time, conveys information.
Understanding language and information thus requires understanding
thought, action and intentional phenomena in general. For instance,
the development of viable theories of the use of language for
communication requires an understanding of the underlying notions of
action and intention. Moreover, a theory of common sense incorporates
a theory of action (together with a theory of the world.). A theory of
common sense is itself of interest for a number of reasons; chief among
them is the following one: though common sense itself may be
unscientific because of its very nature, it is clearly what enables
humans, in large part, to cope with a complex world. It follows from
this centrality of common sense reasoning that any scientific
understanding of human thought and action and any system that
successfully interacts with humans will have to incorporate an
understanding of such ordinary conceptions, even if based on
conceptions radically different from the common sense ones.
-------
∂24-Oct-84 1149 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 24 Oct 84 11:49:20 PDT
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Wed 24 Oct 84 11:46:54-PDT
Date: Wed 24 Oct 84 11:47:39-PDT
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: next F4 meeting
To: f4@SU-CSLI.ARPA
The next F4 meeting will be Tuesday, November 6, at 3:15 in Ventura.
Please try to arrive promptly so we can start the meeting on time.
For next time, we will be discussing chapters 3, 4, and 5 of Gil
Harman's ms. "Change in View."
--Bob
-------
∂24-Oct-84 1403 FISHER@SU-SCORE.ARPA Dean's Award for Services
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 Oct 84 14:03:04 PDT
Date: Wed 24 Oct 84 13:58:20-PDT
From: Norine Fisher <FISHER@SU-SCORE.ARPA>
Subject: Dean's Award for Services
To: faculty@SU-SCORE.ARPA
The Dean's Award for Service began in 1981-82 as a way of recognizing and
applauding some of the extraordinary service contributions made by Stanford
students - service to the University, to the community, and to other students.
Any enrolled student is eligible for this recognition; it is my hope to announce
several awards each quarter, for a total of 15-20 each year.
Our experience with the program is that the recipients are surprised and very
pleased by this modest institutional thank-you. There are photogrtaphs and
stories in the campus and other local papers, handsome certificates with
individual citations and photographs, a nice medallion, and an end-of-quarter
dinner with the recipients, some of their friends and family members, and their
recommenders. To see certificates of past Service Award winners, stop by the
lobby of the Old Union.
The continued success of this award program hinges on Stanford people knowing
about it, thinking of it when they counter exceptional contributions of service
on the part of Stanford students, and taking the time to write me a letter (or
memo) about the student and his/her work. I would especially welcome nomina-
tions before NOVEMBER 1 for Fall Quarter awards.
If you have any questions about the Dean's Award for Service, please call me or
my assistant, Nadine O'Leary, at 7-4l62. Nominations may be sent to me at 323
Old Union.
The Service Award program has become a nice way of expressing appreciation to
some of the amazing student-citizens in our midst. My thanks for your continued
support and help.
James W. Lyons
Dean of Student Affairs
-------
∂24-Oct-84 1505 CC.CLIVE@UTEXAS-20.ARPA 36-Bit 20th Anniversary Events
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 24 Oct 84 15:04:50 PDT
Date: Wed 24 Oct 84 17:05:15-CDT
From: Clive Dawson <CC.Clive@UTEXAS-20.ARPA>
Subject: 36-Bit 20th Anniversary Events
To: jmc@SU-AI.ARPA
Dear Prof. McCarthy:
On behalf of the DECUS Large Systems SIG I would like to invite you
to attend the 36-Bit 20th Anniversary Celebration which will be held
during the Fall DECUS conference in Anaheim on December 12, 1984.
Several events have been planned to help observe the occasion. The
keynote session is entitled "36-Bit Pioneers Round Table". We would
be honored to have you participate in the session as one of the panelists.
The purpose of the session is two-fold: to provide the audience with
a glimpse of what things were like in the early days of the PDP-6 and
PDP-10 by getting people such as yourself to do a bit of reminiscing,
and to attempt to identify the contributions made by DEC's 36-bit line
to Computer Science and computing in general. We are shooting for a
panel of about 8 people; the session will be 90 minutes (4:30 - 6:00 PM)
which should allow each panelist to make a few remarks, followed by
some general discussion and questions from the audience. We believe
this session will be a very important event in the history of computing.
A video tape of the session will be submitted to the Computer Museum.
Following this session, the 36-Bit Anniversary Banquet will be held.
We would be pleased to have you attend as an invited guest. Other
anniversary events include the "36-Bit Trivia Bowl" which will pit
a team from DEC against a team of customers; a memorabilia exhibit
(you may be aware that Stanford's PDP-6 will actually make the trip
to Anaheim!); and a repeat of a talk by Peter Hurley from DEC entitled
"The History of TOPS (or Life in the Fast AC's)".
I really hope you will be able to join us in Anaheim. Your contributions
to the original development of the 36-bit architecture as well as to
the importance of their role during the last 20 years are unsurpassed by
anybody outside of DEC itself.
This message is actually supposed to be a preliminary inquiry to learn
whether it will be possible for you to attend. A formal invitation
will follow. Please let me know if you have any questions or if I can
help resolve any difficulties in order to make your participation
possible.
Regards,
Clive Dawson
Net address: Clive@UTexas-20
U.S. Mail: MCC
Artificial Intelligence Program
9430 Research Blvd.
Austin, TX 78759
Telephone: (512) 834-3430
-------
∂24-Oct-84 1531 @SU-SCORE.ARPA:HOBBS@SRI-AI.ARPA Ignore previous message
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 Oct 84 15:31:44 PDT
Received: from SRI-AI.ARPA by SU-SCORE.ARPA with TCP; Wed 24 Oct 84 15:10:01-PDT
Date: Wed 24 Oct 84 15:10:25-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Ignore previous message
To: jmc@SU-SCORE.ARPA
cc: hobbs@SRI-AI.ARPA
John --
I don't know if you received my previous message asking you to be the
discussant for my talk to CSLI on Commonsense Summer on Nov. 1 at 2:15,
but when I found out you were out of town, I asked Johan de Kleer to
be discussant instead. I hope you will be able to attend, however.
-- Jerry
-------
∂24-Oct-84 1653 PYLYSHYN@CMU-CS-C.ARPA Ms on the Frame Problem
Received: from CMU-CS-C.ARPA by SU-AI.ARPA with TCP; 24 Oct 84 16:52:47 PDT
Received: ID <PYLYSHYN@CMU-CS-C.ARPA>; Wed 24 Oct 84 19:53:18-EDT
Date: Wed 24 Oct 84 19:53:16-EDT
From: Zenon <Zenon.Pylyshyn@CMU-CS-C.ARPA>
Subject: Ms on the Frame Problem
To: jmc@SU-AI.ARPA
You will have received a reminder from me by old fashioned mail regarding
the paper you said you could fashion from a section of a paper that uses
circumscription to solve (do you really mean "solve") the frame problem.
I would appreciate having it as soon as you can manage. I would also
appreciate having your view on what the "frame problem" is: I suspect people
are using it in rather different ways. For example, near the end of Fodor's
book on Modularity of Mind, Jerry equates it with the general problem of
induction -- as do several others). Pat Hayes objects violently to this
move and plans to say so in his paper (in progress). What is your view?
Can you think of any other worthwhile papers/authors that might contribute
to a discussion of "The frame problem and other problems of wholism in AI"?
-------
∂24-Oct-84 1855 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 24 Oct 84 18:55:24 PDT
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Wed 24 Oct 84 18:51:57-PDT
Date: 24 Oct 84 1845 PDT
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
To: "@DIS.DIS[1,CLT]"@SU-AI.ARPA
Speaker: Carolyn Talcott, Stanford Computer Science
Title: The Essence of RUM:
A theory of the intensional and extensional aspects
of Lisp-type computation.
Place: Room 381-T, 1st floor Math. Corner, Stanford University
Time: Monday October 29, 4:15-5:30 p.m.
S. Feferman
∂24-Oct-84 2047 SMC car
I have been both extremely busy and also very sick for a couple of days,
so I did not get a chance to take your car in. However, there isn't actually
any problem with the heat. The system is set up to allow some flow when
the lever is on "FRESH" as opposed to "REC" (recycled) the fan just increases
the rate. So if you want no heat at all, make sure the lever is on "REC". This
seems to work fine.
I am at Silk Purse Ranch in Las Vegas, Nevada. I expect to be back
sometime on Monday.
∂25-Oct-84 0138 DAVIES@SUMEX-AIM.ARPA QLambda Progress report
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 25 Oct 84 01:34:19 PDT
Date: Thu, 25 Oct 1984 01:37 PDT
Message-ID: <DAVIES.12058193966.BABYL@Sumex>
From: DAVIES@Sumex
To: RPG@SAIL, JMC@SAIL
Subject: QLambda Progress report
cc: Davies@Sumex
This is to let you know what I've been doing with your brainchild over
the last few weeks.
I spent the last week of September and the first week of October
trying to understand QLambda from the code and documentation. I have
made several passes over both, and think I have a pretty good grasp of
it. There are still some nuances involving QLambda closures that I
don't think I fully understand yet, but I'm exploring these throught
the vehicle that I'm about to describe.
My work over the past two weeks has been directed at solving the
problem Dick pointed to in the HPP Architectures meeting two weeks
ago: the existing QLambda simulation is too slow to be an effective
vehicle for experimentation with expert systems. Dick remarked that
carrying out a parallel quicksort of 20 items took approximately 6
HOURS OF CPU TIME ON A KL-10. Clearly, we cannot afford this kind of
simulation overhead in our experiments with large expert systems.
To relieve this problem, I embarked on the development of what I call
the Low Overhead Qlambda System, or LOQS for short. LOQS uses macros
and the Zetalisp process system on the 3600 to implement QLambda
within Zetalisp. I have implemented QLET (all three forms,
CATCH/THROW, and QLAMBDA). The overhead for spawning a process is
only 3 milliseconds, assuming the processes are allocated from a
resource.
There are two major restrictions on my implementation which do not
apply to Dick's. The first is that the list of closure variables must
be specified when creating a closure. This saves us from having to
carry complete environments around, as in Dick's implementation, but
it puts an extra burden on the QLambda programmer. Secondly,
expressions using EAGER variables within QLET are evaluated using
substitution semantics. This means that SETQ is not permitted for
these variables, and other restrictions apply on the use of EAGER
variable names as function names, quoted symbols, or macro keyowrds.
It remains to be seen whether this restriction is bearable.
CATCH and THROW were a challenge, but not insurmountable. The
challenge was to be able to exploit the power of THROW without
incurring the excessive overhead of maintaining the backpointers to
the CATCH. The tradoff was made by only maintaining the catch threads
at the loci of parallelism, either QLET or QLAMBDA or CATCH itself.
Hence the overhead of parallelism is only incurred when and where
parallelism is used; otherwise the system thinks it's running compiled
Zetalisp programs.
There's still some work to be done on LOQS, but it's pretty well
fleshed out by now. I expect to have a running version by the time of
next week's HPP meeting on Wednesday.
Penny has suggested that my work on QLambda be the topic of the next
meeting. And so it will.
-- Byron
∂25-Oct-84 1038 RA Invitation to give a talk
Paul Edwards from UC Santa Cruz (408)425 7454 would like you to give
a talk in March in a conference which will deal with the military and
computers.
∂25-Oct-84 1119 JJW Information on Sequoia
To: "@HEP.DIS[E84,JMC]"@SU-AI.ARPA
(This is from a MIT seminar announcement posted on their BBoard.)
Sequoia Systems is a new computer manufacturer, producing tightly-coupled,
fault-tolerant, multi-processor systems especially suited for on-line
transaction processing. A system can be expanded incrementally from
one processor (.75 MIPS), one I/O processor (.5 MIPS), and 2 megabytes
of memory up to 64 processors, 96 I/O processors, and 254 megabytes
of memory. Each processor has direct access to every memory and I/O
processor. Fault-tolerance, provided by hardware fault detection and
operating system fault recovery, is entirely transparent to the user.
The operating system kernel is a new design, with file functions residing
on the I/O processor and no centralized control.
The interface is fully compatible with UNIX operating systems.
∂25-Oct-84 1431 LIBRARY@SU-SCORE.ARPA Go, Chess, Poker--New Books in the Math/CS Library
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 25 Oct 84 14:31:46 PDT
Date: Thu 25 Oct 84 14:25:35-PDT
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Go, Chess, Poker--New Books in the Math/CS Library
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
The Application of Chess Theory by Geller GV1452.G44 1984
The Theory and Practice of Go by Korschelt GV1469.G7K63
The Middle Game of Go vol. 1 Sakata Eio, 9-Dan GV1460.3S24 1974 v. 1
Winning Poker Strategy by Silberstang GV1251.S4
HLlull
-------
∂25-Oct-84 1442 LIBRARY@SU-SCORE.ARPA New Books Math/CS Library
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 25 Oct 84 14:42:30 PDT
Date: Thu 25 Oct 84 14:35:57-PDT
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: New Books Math/CS Library
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
The Architecture of Cognition by Anderson BF311.A5894 1983 c. 2
Canadian Society for Computational Studies of Intelligence.
Proceedings of the Biennial Conference:
1984 (8413604)
1982 (8413603)
1980 (8413605)
Presentation Graphics on the Apple Macintosh by Lambert T385.L34 1984
LOGLAN by Brown, J. Loglan Institute, Gainsville Florida
1. A Logical Language PM8590.B7 1970A
2. Methods of Construction PM8590.B872 1970A
3. Speaking Loglan PM8590.B873 1965A
4. A Loglan-English Dictionary PM8590.B874 1970A
HLlull
-------
∂25-Oct-84 1734 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA postdoc announcements
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 25 Oct 84 17:34:45 PDT
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Thu 25 Oct 84 17:30:55-PDT
Date: Thu 25 Oct 84 17:31:56-PDT
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: postdoc announcements
To: principals@SU-CSLI.ARPA
cc: emma@SU-CSLI.ARPA, stucky@SRI-AI.ARPA, halvorsen@XEROX.ARPA
We are preparing to send out posters announcing the availability
of postdoc positions for next year, and we want to make sure that we
have complete coverage of all the institutions that should receive
copies. The addresses we have are divided into three files containing
U.S., Canadian, and other foreign instutions (respectively):
<CSLI>COLLEGE.LIST
<CSLI>COLLEGE.CAN
<CSLI>COLLEGE.LIST
(Copies of these files will be put on the CSLI directory at SRI-AI to
make them more accessible to people at SRI.) We would appreciate it
if all of you would look over these lists for completeness and send
suggested additions to Emma Pease (EMMA@CSLI). We are particularly
concerned about gaps in the list of non-North-American instutions.
Please feel free to consult any colleagues who might be more
knowledgeable.
Thanks,
Bob
-------
∂26-Oct-84 1034 RA
Ed Fredkin called (617) 237 1022
∂26-Oct-84 1426 SCHAFFER@SU-SCORE.ARPA High-TeX Mail Forwarding Stickers
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Oct 84 14:25:50 PDT
Date: Fri 26 Oct 84 14:07:37-PDT
From: Alejandro Schaffer <SCHAFFER@SU-SCORE.ARPA>
Subject: High-TeX Mail Forwarding Stickers
To: students@SU-SCORE.ARPA, faculty@SU-SCORE.ARPA, secretaries@SU-SCORE.ARPA,
research-associates@SU-SCORE.ARPA, su-bboards@SU-SCORE.ARPA
I have made sheets of sticky forwarding labels for all persons
formerly affiliated with the department who asked that their mail be
forwarded outside of the reach of ID mail, but within the United
States. The sheets of labels are paper-clipped to the appropriate
forwarding cards in the mail cabinets. When you find a piece of mail
that needs to be forwarded, look for the addressee's name in the mail
cabinets, peel off a label, stick it on the envelope, and put the
enevlope in the outgoing U.S. mail tray. There are 30 stickers on each
sheet; please let me (Alex Schaffer, schaffer@score) know when a sheet
of stickers is almost exhausted. Also, please let me know if you
would like stickers. Students who are graduating or are going away for
the summer should let me know, so that their mail will be properly
forwarded.
Thanks to Joe Pallas who wrote the TeX program to format the stickers.
-------
∂28-Oct-84 1811 RTC Disk Space
I'm running out of disk space on SAIL. Would you agree
to another 100 blocks for me? (I now have 150 blocks)
Ross
∂28-Oct-84 2348 @SU-SCORE.ARPA:WIEDERHOLD@SUMEX-AIM.ARPA Re: AI track in MS--please respond!
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Oct 84 23:48:32 PST
Received: from SUMEX-AIM.ARPA by SU-SCORE.ARPA with TCP; Sun 28 Oct 84 23:45:12-PST
Date: Sun 28 Oct 84 23:49:49-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
Subject: Re: AI track in MS--please respond!
To: SHAWN@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
In-Reply-To: Message from "Shawn Amirsardary <SHAWN@SU-SCORE.ARPA>" of Sun 21 Oct 84 11:19:19-PDT
Since there is an MS-AI program there seems not be much justification for doing so.
There is a strong tradition in AI in learning by doing, and that requires
the 2 year time frame. I personally recommend a two-year time frame, with
active research involvement in systems areas as well, if you want to learn
the field as well as Stanford can provide.
Gio
-------
∂29-Oct-84 0601 ATP.BLEDSOE@UTEXAS-20.ARPA [allegra!walker@Berkeley (Don Walker): the AAAI and an electronic library for the AI community]
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 29 Oct 84 06:01:05 PST
Date: Mon 29 Oct 84 08:01:23-CST
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: [allegra!walker@Berkeley (Don Walker): the AAAI and an electronic library for the AI community]
To: jmc@SU-AI.ARPA, aaai-office@SUMEX-AIM.ARPA, genesereth@SU-AI.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
John and Mike,
I would very much like your reaction to the following message
from Don Walker. Is there reason to pursue a two pronged attack on
the problem.
Woody
---------------
Return-Path: <allegra!walker@Berkeley>
Received: from UCB-VAX.ARPA by UTEXAS-20.ARPA with TCP; Sun 28 Oct 84 10:00:19-CST
Received: by UCB-VAX.ARPA (4.24/4.31)
id AA06593; Sun, 28 Oct 84 06:59:41 pst
Received: by mouton.UUCP (4.12/4.7)
id AA23342; Sun, 28 Oct 84 10:53:34 est
Date: Sun, 28 Oct 84 10:53:34 est
From: allegra!walker@Berkeley (Don Walker)
Message-Id: <8410281553.AA23342@mouton.UUCP>
To: bledsoe@utexas-20.ARPA
Subject: the AAAI and an electronic library for the AI community
Cc: amsler@Berkeley, feinler@sri-nic.ARPA, walker@Berkeley
Woody,
I don't know whether you are aware of the extent to which
I have been involved in discussions about the development of a resource
for the AI literature. With Bob Amsler and Jake Feinler, who is in
charge of the ARPANET Network Information Center, I have been trying
to establish a proper long as well as short range perspective on this
critically important resource. I am in a position to volunteer
substantial support from Bellcore, and Jake is extremely interested in
getting ARPA into the picture, as well as in volunteering NIC resources
directly. Accordingly, we would like to be kept involved in developments.
Both McCarthy and Genesereth seem to be opting for a short term solution;
while that is not unreasonable in and of itself, it seems to us that there
are ways of combining short and long term solutions.
As people with quite extensive knowledge of the Information
Science community from which the current technology flows, we are keenly
aware not only its limitations in capability, but as well of the fact
that it cannot be extended. Having just come from the annual meeting of
the American Society for Information Science, where I made strong
statements about the potential of AI for bibliographic, textual, and
information retrieval more generally, I want very much to follow up on
this approach, because I think it has revolutionary implications for
information science--and because it can be extremely valuable for AI
as well.
As President of AAAI, I would like to encourage you to believe
that we can be valuable assets, and that the directions we are advocating
can provide an immediate service to the community and at the same time
allow research to be carried out on that will lead to the development
of capabilities for coping with the literature that are worthy of
AI. There is no need for the cobbler's children not to wear shoes!
Don
-------
∂29-Oct-84 0949 WITHGOTT@SU-CSLI.ARPA string on finger
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 29 Oct 84 09:49:10 PST
Date: Mon, 29 Oct 1984 09:46 PST
Message-ID: <WITHGOTT.12059342372.BABYL@SU-CSLI.ARPA>
From: WITHGOTT@SU-CSLI.ARPA
To: PCOHEN@SU-CSLI.ARPA, JMC@SU-CSLI.ARPA, WITHGOTT@SU-CSLI.ARPA
Subject: string on finger
Please send a one paragraph abstract of your research seminar talk to
Dikran@SU-csli, cc: Meseguer@sri-ai.arpa, by Tuesday afternoon on these dates:
PHIL COHEN: October 30
JOHN MCCARTHY: November 6
MEG WITHGOTT: November 20 :title by November 13
Thanks!
∂29-Oct-84 0957 RA
Burton Smith called (303) 337 7900.
∂29-Oct-84 1210 EMMA@SU-CSLI.ARPA Re: postdoc announcements
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 29 Oct 84 12:10:37 PST
Date: Mon 29 Oct 84 12:04:25-PST
From: Emma Pease <EMMA@SU-CSLI.ARPA>
Subject: Re: postdoc announcements
To: BMOORE@SRI-AI.ARPA
cc: principals@SU-CSLI.ARPA, stucky@SRI-AI.ARPA, halvorsen@XEROX.ARPA
In-Reply-To: Message from "Bob Moore <BMOORE@SRI-AI.ARPA>" of Thu 25 Oct 84 17:31:05-PDT
The posters have arrived. One has been put on the CSLI bulletin
board for your examination. I still need addresses.
Emma
-------
∂29-Oct-84 1217 RA AAAS symposium
Manfred Kochen would like you to let him know whether you can participate
in the symposium. His # (313) 764 2585. A letter about it is on the top
of your incoming mail box.
∂29-Oct-84 1348 RPG Subcontracts
There was some discussion among the ARPA folks and me about Stanford
subcontracting the Common Lisp work at Stanford to Lucid. This would
involve the blue pages work and the yellow pages work. I think we're in
a pretty good position to take that on. How shall we proceed?
We have been looking at the various pieces of multiprocessor hardware, and
we've pretty-much decided that the way to do the HEP is with a byte-code
compiler and interpreter. That is, we will compile Lisp down to some
abstract machine code, and we will hand-code an interpreter for that
language in HEP assembly language (or PASCAL). The interpreter will
run in the program memory. Unless we do this, it will take a very long
time to get a Lisp running.
We are pursuing the other manufacturers, such as Synapse, Sierra,
and Sequent.
-rpg-
∂29-Oct-84 1445 RA
Sally (7-9784) called re: Norm Wessels.
∂29-Oct-84 1654 FISHER@SU-SCORE.ARPA Tuesday lunches
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 Oct 84 16:54:38 PST
Date: Mon 29 Oct 84 16:51:47-PST
From: Norine Fisher <FISHER@SU-SCORE.ARPA>
Subject: Tuesday lunches
To: faculty@SU-SCORE.ARPA
Our hosts for the room 146 in MJH find that Tuesdays are extremely busy
for meetings - one backed up to another. Therefore, the secretary/receptionist
who is in charge of that room can hardly get in there between meetings to be
sure it is in order for the next group. She as asked me then to tell you that
it would be VERY MUCH APPRECIATED if we would straighten chairs upon departure
and remove garbage to the back door bin. Apparently, the food remains in
the trash cans in the room get a bit ripe by 6:30 p.m. - when the last group
leaves. She thanks you through this MM system. Norine
-------
∂29-Oct-84 1654 RA
Have you made your annual gift to Cal Tech Alumni Fund? Please let me know.
∂29-Oct-84 1727 burton@Navajo HEP benchmark you wanted
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 29 Oct 84 17:27:42 PST
Date: Mon, 29 Oct 84 17:26:18 pst
From: Burton Smith <burton@Navajo>
Subject: HEP benchmark you wanted
To: jmc@sail
Cc: rpg@sail
Kahn is asking us (you too?) about the proposal. Have
you decided on a machine yet? Anyway, we ran a benchmark
to determine the number of instruction streams required
to get 10 mips per processor as a function of memory
reference fraction (i.e., what fraction of the instructions
executed reference data memory. The loop looked roughly
like this:
loop: load r5,r5
and r5,r5,r5
...
and r5,r5,r5
branch if negative r5,loop
with the number of ands (noops) varying from 0 to 5 and the
number of instruction streams executing the loop in parallel
varying from 2 to 32. The program was run on a one processor
system with Euler switch routing, so that the memory latency
was 36 clocks (3.6 microseconds). Such a long delay would normally
be encountered only in a system with a large number of
processors; a more typical delay for a four processor system
is about 28 clocks, and is 24 or so for one processor. The results
conform within a few percent to a simple theoretical model which
gives the number of instruction streams p as a function of the
memory reference fraction m and the memory pipeline length L
(in clock cycles) as follows:
p = 8*(1 - m) + L*m
In the equation, 8 is just the nonmemory pipeline length.
Presented in tabular form, the number of instruction streams
needed to fill the "hybrid length" pipeline with L=36 are:
Memory Instruction
reference streams
fraction needed
.500 22
.333 17.3
.250 15
.200 13.6
.167 12.7
Of course the lesser delay for a "smaller" configuration
reduces the number of instruction streams significantly. If one has
fewer than the number of instruction streams needed for full
speed, the speedup is linear; speed = 10 mips * q/p, where p
is given by the equation above and q (q<p) is the number of
instruction streams employed. Asymptotically (q>p) the measured
speed was in no case less than 9.98 mips including system overhead
(no swapping, no I/O).
Let me know what else we should do or can do, if anything.
Best regards,
Burton
∂29-Oct-84 2116 JJW 206 report
Welcome back. My three sessions teaching 206 went fairly well, and hopefully
the students learned some of what I tried to teach them.
The first day I covered most of sequential programming: PROG, RETURN, GO, SETF
(which I told them to prefer over SETQ), PROGN and DO. Since this was in the
middle of their work on the first homework set, I told them not to use any of
these things in solving those problems; only pure Lisp.
The second day I briefly explained CATCH and THROW and then spent the rest of
the time discussing macros (including backquote syntax). The main examples
were writing a WHILE macro that expanded into a DO, and an IF macro that
expanded into COND. Finally, I did a Common Lisp version of the MACDEF
example in your book.
I continued macros on the third day, giving a complex example that took most
of the period to explain. This was a version of LET that I called DLET, which
allows destructuring. (Maclisp has this built-in to its LET macro, but Common
Lisp has destructuring only in its DEFMACRO.) This may have been overkill, I
discovered, but I did want them to see how a moderately complicated macro is
defined. There were about 15 minutes left after this, so I described RPLACA
and RPLACD and the SETF equivalents which I again told them to prefer. But I
didn't have time for any real examples of these.
Finally, I gave them an assignment which I made due Tuesday, October 6, that
involves writing some macro definitions and perhaps some sequential code
depending on how they decide to answer one of them. I also asked them to read
chapters 3, 7 (except 7.2 and 7.9) and 8 of the Common Lisp manual.
Overall, I think I was successful in explaining the various features that I
set out to describe, but not so great in giving motivation or reasons to use
or not use these features. So if you return to discussing sequential programs
later, they could use more of this sort of explanation.
Before giving each lecture, I prepared fairly detailed notes on what I wanted
to say. You might find these useful in rewriting chapter 5, since they follow
the same general sequence and add some new examples.
181 184 185
∂30-Oct-84 0709 ATP.BLEDSOE@UTEXAS-20.ARPA [AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>: [AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>: new person]]
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 30 Oct 84 07:09:04 PST
Date: Mon 29 Oct 84 21:12:40-CST
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: [AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>: [AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>: new person]]
To: Amarel@RUTGERS.ARPA, Brachman@SRI-KL.ARPA, Bledsoe@UTEXAS-20.ARPA,
Buchanan@SUMEX-AIM.ARPA, KRD@MIT-MC.ARPA, Bengelmore@SRI-KL.ARPA,
Lerman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA,
JMC@SU-AI.ARPA, Minsky@MIT-MC.ARPA, Nilsson@SRI-AI.ARPA,
Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA, Stan@SRI-AI.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Stefik@XEROX.ARPA, Tenenbaum@SRI-KL.ARPA,
Walker@SRI-AI.ARPA, PHW@MIT-MC.ARPA, Fikes%usc-ecld@USC-ECL.ARPA,
aaai-office@SUMEX-AIM.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
At the Council Meeting in August we voted to enlarge the staff of the
AAAI office. The following messages from Claudia explains her efforts
to do just that by hiring Lorraine Cooper to help direct the Trade Shows.
Please let us know (by Friday, Nov 2) if you have any objection with this.
Else we wil proceed with it.
Woody
---------------
Return-Path: <AAAI-OFFICE@SUMEX-AIM.ARPA>
Received: from SUMEX-AIM.ARPA by UTEXAS-20.ARPA with TCP; Mon 29 Oct 84 14:23:42-CST
Date: Mon 29 Oct 84 11:43:29-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: [AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>: new person]
To: aaai-office@SUMEX-AIM.ARPA, Bledsoe@UTEXAS-20.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Woody,
Although the AAAI is the host to IJCAI-85 Conference, this new person
would be responsible management of the trade show (this year, it wil
be a 100 booth show as opposed to past 45 booth shows); the logistics
of the tutorial program; management of the pre-registration and
on-site registration; and most importantly, coordinate the production
and the mailing of the conference pposter, brochure and program.
The last task is extremely time-consuming.
We may also be resposible for the dorm housing reservations. We're
essentially doing the same conference coordination except for
a few exceptions like hospitality and on-site session management.
In fact, our workload will increase by at least 40% with the
addition of the coordination of the dorm reservations.
In addition, this person with myself will be assisting the
trade show and conference committees.
-- Claudia
---------------
Mail-From: AAAI-OFFICE created at 28-Oct-84 19:48:34
Date: Sun 28 Oct 84 19:48:33-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: new person
To: Bledsoe@UTEXAS-20.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Woody,
In the last couple of weeks, I've begun the search for a new
person who would coordinate the conference and trade show (which
is getting larger every year). This person must be able to
provide expert experience in helping us formulate our policies
and procedures for conference and trade show management.
I placed an ad in the San Jose Mercury and got 75 resumes for this
position. Out of that 75 resumes, only 7 people were qualified
(qualified being at least having 5 years of experience working with
Fortune 500 companies).
Out of that 7, two had taken jobs; three wanted to be "upwardly
mobile" position in a large corporation; and two out of the last three
had mixed experience and reference checks. Only one had exceptional
references and experience (but no hands-on computer experience). This
person, Lorraine Cooper, has at least 20 years of experience in the
trade and tourism industries, working in the U.S., Pacific Basin and
Canada. She's been a consultant for the last 10 years and wants to
change the direction of her career towards the computer industry
(she's had considerable experience working with medical associations).
She's also had considerable experience working with large trade shows
and conferences and can bring in her industry experience to the
development of the policies under discussion. Richard and I have
interviewed her and would like to offer her the position ($28,000/year).
We think she is overqualified for this position; however, if she
stays long enough to help develop those policies and procedures as well
as working on this year's trade show and tutorial programs, I
think the time we spend on training her will be well worth our
investment.
I'd like to hear your comments on this matter. Thanks....
-- Claudia
-------
-------
-------
∂30-Oct-84 0838 GOLUB@SU-SCORE.ARPA lunch
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Oct 84 08:38:00 PST
Date: Tue 30 Oct 84 08:34:32-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: lunch
To: faculty@SU-SCORE.ARPA
We'll have our usual lunch today. Nothing special is planned.
There probably be several visitors next month.
GENE
-------
∂30-Oct-84 0843 RTC CS206
Just in case I don't see you before class today:
We originally planned a midterm on Thursday. If you plan to
give it then, please announce what the TV students should do.
(Should they come to campus or stay at home?) If you don't
plan to give it, when should it be?
Please announce that the Common Lisp book has arrived at the bookstore.
We should meet sometime to work out some misunderstandings over
the unification program.
Ross
∂30-Oct-84 0902 RA
I am going to be at a workshop from 9:30 to 12:00 today, and take the
afternoon off.
∂30-Oct-84 0926 GOLUB@SU-SCORE.ARPA lunch
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Oct 84 09:26:36 PST
Date: Tue 30 Oct 84 09:19:30-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: lunch
To: faculty@SU-SCORE.ARPA
Nils Nilsson will be at the lunch today.
GENE
-------
∂30-Oct-84 0934 shore@nrl-css Re: an early bug (maybe)
Received: from NRL-CSS.ARPA by SU-AI.ARPA with TCP; 30 Oct 84 09:34:01 PST
Date: Tue, 30 Oct 84 12:33:03 est
From: John Shore <shore@nrl-css>
Message-Id: <8410301733.AA26810@nrl-css>
To: JMC@SU-AI.ARPA
Subject: Re: an early bug (maybe)
Cc: shore@nrl-css
Thanks. I'm not actively collecting the stories anymore, but
some trickle in as the original file gets around. If enough accumulate,
I'll put out another version.
I wouldn't be surprised if the famous DO I = 1.5 bug in fact came
from the recreational problem -- likewise many of the other stories.
History is hard to pin down, whether it be politics or software.
jes
∂30-Oct-84 1229 RA
I tried calling CS Dept. at UC Davis but they were probably all out to lunch
because I didn't get any answer.
∂30-Oct-84 1600 JMC*
What does Withgott want about seminar.
∂30-Oct-84 1954 LIBRARY@SU-SCORE.ARPA New Books in the Math/CS Library
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Oct 84 19:54:12 PST
Date: Tue 30 Oct 84 19:50:54-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: New Books in the Math/CS Library
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
VLSI and Modern Signal Processing Workshop. Univesity of Southern California.
November 1983 (8414355)
Tutorial on Software Design Techniques 4th edtion. by Freeman and Wasserman
QA76.6T88 1983
Automated Microcode Synthesis by Mueller QA76.6M825 1984
HLlull
-------
∂31-Oct-84 0059 cheriton@Pescadero CSD Facilities Committee - topics to address
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 31 Oct 84 00:59:07 PST
Date: Wed, 31 Oct 84 00:57:34 pst
From: David Cheriton <cheriton@Pescadero>
Subject: CSD Facilities Committee - topics to address
To: csdfacilities@Pescadero
1. I have created a mailing list for the committee on Pescadero,
namely csdfacilities@pescadero. Members are Cheriton (chairman),
Pratt, McCarthy, Binford with student members Jeff Mogul,
Jim DelaHunt and Joe Weening. Welcome. I have assumed that
Len Bosack should be a member as well.
2. I feel we need to identify the topics we want to address this year.
Here are some of my candidates:
a) Parallel computation facilities, etc. like HEP, Synapse purchase
as well as Ullman-suggested participation in supercomputer center.
b) Equipment space planning - what have we got, what equipment is
coming and what does it need versus what we got.
c) Additions to general dept. computing resources. In this vein,
I would like to mount a crusade to purchase a bunch of workstations
for student use - more on this later.
d) CSD-CF projects such as the central file server (or whatever it is
called) and Unix support.
I will also poll CSD faculty in general to see what concerns others
have in the area of computer facilities.
(In that vein, is there any written statement of the charter of this
committee?)
3. I would like to have a meeting in the next few weeks to discuss
these issues briefly and decide on a course of action.
I propose we meet either Tues. Nov. 6th at 2:30 (or later) or else Thurs.
Nov. 8th at 2:45 pm. Please let me know which you can make
(if either) and I will schedule from there - would be helpful to
know any general scheduling constraints you have.
I would like to decide on issues to be tackled, and then work in terms
of proposals, with individuals or small groups working out the details.
Judging by the past, we cant (and dont want to) have long meetings to
work out plans in real time.
So, let me know what we should on this year on this committee
and if you can make the Tues or Thurs. time.
Personally, I would prefer the Thurs. time.
∂31-Oct-84 0934 JJW@SU-AI.ARPA Meeting date
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 31 Oct 84 09:34:21 PST
Received: from SU-AI.ARPA by Pescadero with TCP; Wed, 31 Oct 84 09:32:55 pst
Date: 31 Oct 84 0933 PST
From: Joe Weening <JJW@SU-AI.ARPA>
Subject: Meeting date
To: csdfacilities@SU-PESCADERO.ARPA
I could be there either Tuesday or Thursday, but on Thursday would also like
to be at the IBM reception at 4:00. Hopefully the meeting won't go past then.
Joe
∂31-Oct-84 1001 cheriton@Pescadero On-line library
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 31 Oct 84 10:01:18 PST
Date: Wed, 31 Oct 84 09:59:54 pst
From: David Cheriton <cheriton@Pescadero>
Subject: On-line library
To: jmc@su-ai
Cc: cheriton@Pescadero
I feel my comments at lunch regarding your project were not well received
in general so I would like to briefly clarify:
1. I am very enthused about such a project and think you should go ahead.
It seems to me that the major job (like any library) is collecting
and indexing.
2. I believe the indexing and access mechanism could with relatively modest
effect handle material on several machines rather than just one.
It is data structures of the indexing that must provide for this, even if
the initial version handles only one machine. I was primarily advocating
planning for multi-machine indexing. However, if I was doing the project,
I think I would give it reasonable priority - rather than solve the problems
of moving documents from score and sail to a single machine.
3. I think the single machine model is a loser from several standpoints:
a) Performance - a 750 isnt much of a machine. I know because I manage
3 of them. Saying that we will deal with this problem when we encounter
it is failing to recognize the obvious in my mind. Like buying a Honda
to pull a large trailer.
b) Reliability - in spite of Len's excuses, I claim the CSD file server
is dead now because of its flakey hardware. The days of basing the
availability of a service on one flakey computer are passing, slowly
but surely.
c) autonomy - lots of projects can afford lots of disk space and
would prefer to be "branch" libraries than have duplicate copies or
give up their copies. For instance, after the lunch, I realized
that I expect to have about 4 gigabytes of storage on the machines
I own by the end of November. That storage is spread across 5 CPUs
that are either 750's or SUN 68010's - roughly comparable in speed.
In general, another related key point is: the most cost-effective on-line
secondary storage right now is a 480 Megabyte Fujistu disk for $10K or so.
Almost everyone can afford that, and if various groups have machines
and tape backup facilities in place, there is not much of a cost argument
for basing everything on a single central file server.
Finally, I think it would be far more interesting to tackle the distibuted
library problem (local to CSD machines say). It seems primarily an issue
of agreeing on standard protocols and procedures plus a modest level of
programming, but yielding a much more powerful system. In a sense, I
see this as part of the problem you identified some time ago as the
"other people's files" problem. And I do feel a judicious approach to
this would yield an available system soon yet allow expansion to a very
distributed form in the future.
∂31-Oct-84 1054 RA
Arlene Conway returned your call (703) 471 0920.
∂31-Oct-84 1117 RA
∂22-Oct-84 1112 RA Expo 85 seminar
To: JMC
Galler (313) 764 9595 wants to know which of the two topics you would
like to talk about:
1) New Generation Systems
2) The quality and Role of Computer Science Education.
This is the second time he called re the expo 85 seminar. Let me know and
I will call him back.
∂31-Oct-84 1321 RA
What is the situation with Christoph Goad, does he intend to come back? if yes,
do you know when?
∂31-Oct-84 1348 VAL my draft on prioritized circumscription and separable formulas
There is a mistake in it. I'm working on a new version.
∂31-Oct-84 1505 Spencer.PA@Xerox.ARPA Kurzweil Machine
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 31 Oct 84 15:04:57 PST
Received: from Cabernet.MS by ArpaGateway.ms ; 31 OCT 84 15:02:41 PST
Date: 31 Oct 84 14:54:06 PST (Wednesday)
From: Spencer.PA@XEROX.ARPA
Subject: Kurzweil Machine
To: JMC@SU-AI.ARPA
cc: Allen.PA@XEROX.ARPA, Brown.PA@XEROX.ARPA, Diebert.PA@XEROX.ARPA,
Ritchie.PA@XEROX.ARPA, Spencer.PA@XEROX.ARPA
John,
Looks like our Kurzweil machine is operating again. Anytime the week of
4 November convenient for you to visit PARC and get a demo?
Bill
∂31-Oct-84 1504 VAL correction for your workshop paper
It seems that in formula (54) ∨ should be replaced by ∧ and ∧ by ⊃. The connectives
you use would be OK for the strict order < defined on the basis of two strict
orders <1, <2.
Vladimir
∂31-Oct-84 1603 RA
I left a check on your desk.
∂31-Oct-84 2049 JDLH@SU-SCORE.ARPA Re: CSD Facilities Committee - topics to address
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 31 Oct 84 20:49:40 PST
Received: from SU-SCORE.ARPA by Pescadero with TCP; Wed, 31 Oct 84 20:48:06 pst
Date: Wed 31 Oct 84 20:47:36-PST
From: Jim DeLaHunt <JDLH@SU-SCORE.ARPA>
Subject: Re: CSD Facilities Committee - topics to address
To: csdfacilities@SU-PESCADERO.ARPA
Cc: JDLH@SU-SCORE.ARPA
In-Reply-To: Message from "David Cheriton <cheriton@Pescadero>" of Wed 31 Oct 84 00:57:47-PST
I vote for meeting on Tuesday. I work Thursdays at 2:45, but can find a
substitute if necessary.
--Jim DeLaHunt JDLH @ Score (415) 327-JDLH
-------
∂31-Oct-84 2216 @SU-SCORE.ARPA:cheriton@Pescadero Computer Facilities committee
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 31 Oct 84 22:15:51 PST
Received: from Pescadero by SU-SCORE.ARPA with TCP; Wed 31 Oct 84 22:10:54-PST
Date: Wed, 31 Oct 84 22:10:48 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Computer Facilities committee
To: faculty@score
I am now chairman of the computer facilities committee. If you have
some particular issue (i.e. "bone to pick", "bee in your bonnet")
regarding computer facilities, please let me know. We will provide
something between "sympathetic ear" -> "group therapy" -> "solution".
∂31-Oct-84 2312 cheriton@Pescadero Proposal to buy SUN workstations
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 31 Oct 84 23:12:20 PST
Date: Wed, 31 Oct 84 23:10:43 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Proposal to buy SUN workstations
To: csdfacilities@Pescadero
Here is my latest crusade in the name of better student facilities.
I would like to get the committee to back this, plus money to rain
down from somewhere. Comments? Hopefully we can discuss at the next
meeting, scheduling soon.
Proposal to Buy N SUN workstations to update CSD student facilities
David Cheriton
Proposal:
I propose we conjure up the funds to buy 10-15 Model 50
("single-board") SUN workstations. These would probably cost
about $10K a piece, so we are talking about $100K - $150K
(and this is with fairly good discount from SMI - and no, they
are not willing to give us the machines.)
A model 50 SUN workstation is new product of SMI, being announced
in a few days. It is basically the size of a terminal, one or two
boards that fit right into the Monitor housing.
It provides 68010 plus 1-4 megabytes of memory (I'd like 2 meg.),
ethernet connection, framebuffer and graphics display plus mouse.
It boot over the Ethernet and expects to get all file access acros
the network as well.
Why Workstations?
1. They provide local editing, local computation facility in general,
multiple windows, etc. that make better use of the computers
we have on the networks (like less byte-at-a-time terminal traffic
overhead) plus allow students to make better use of the network.
2. They provide graphic displays. Our general facilities for graphics
(outside of research groups) has decreased over the last few years
with the death of several Altos.
3. They provide a better education for our students. E.g. ability to
do graphics, distributed computing, etc. for course and programming
projects.
In general, I think the general computing facilities in the dept. have
gone backwards in the 3 years I have been here from the perspective
that we have spent all our money upgrading fairly old systems (score
and sail) and almost nothing on newer approaches. It is only the
reseach projects that have bought Lisp and SUN workstations.
Why SUN workstations?
Basically three reasons:
1. They are what we really want in a workstation.
I.e. they have ethernet, memory mapping,
lots of memory, etc. What companies are willing to give us falls short
in one or more significant ways. E.g the HP workstations have no reasonable
display, network connection or memory managemnt hardware.
2. We have software that runs on them so could use them immediately in
our rather complex network environment. More over, SMI supplies
a Unix system for them whose use is also becoming increasingly common in
these parts.
3. They would provide compatibility with a number of research projects.
For example, my group, the Tex project, the robotics group, the NA
group and various groups in CSL and CIS use SUN workstations.
I even understand there has been some work to use SUNs as remote
terminals for Lisp machines (not sure the status on that though).
Thus, I would argue it is better for us to spent time getting money
to buy these than spend time trying to make do with what various
companies have offered to give us.
Note: SMI is not big enough to afford to give us the equipment.
Also, they cannot keep up with the demand from money-paying customers
right now, so the motivation to give away is low.
I would agree that it would be nice to get some Lisp machines as well.
However, their high cost and lower use of Lisp (I believe) in courses
makes it harder to justify at this time.
Finally, surely in all fairness, it is time to spend something on
the workstation direction. It is my understanding that we blew
$450K or so on upgrading two old timesharing systems that are both
discontinued systems. That may have been the right decision at the time
but surely it is now time to think of the future and future directions.
Finally finally, I think companies will eventually becoming out with
lots of workstations in the SUN workstation or better class, and we have
a good chance of being given some of those. I view this initial 10-15
as filing the void until we get some reasonable machines in our gift
offers.
∂01-Nov-84 0852 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 1 Nov 84 08:49:32 PST
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Thu 1 Nov 84 08:46:34-PST
Date: 01 Nov 84 0839 PST
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
To: "@DIS.DIS[1,CLT]"@SU-AI.ARPA
Speaker: Carolyn Talcott, Stanford Computer Science
Title: The Essence of RUM:
A theory of the intensional and extensional aspects
of Lisp-type computation.
Part II - a continuation of last weeks talk
Place: Room 381-T, 1st floor Math. Corner, Stanford University
Time: Monday November 5, 4:15-5:30 p.m.
S. Feferman
∂01-Nov-84 0932 RA
∂31-Oct-84 2350 JMC
I don't think he does. Why do you ask?
I got a call from H&S asking about him.
∂01-Nov-84 0940 RA
David Chudnovsky called.
∂01-Nov-84 1108 RA
Arlene Conway called (703) 471 0920.
∂01-Nov-84 1310 BRADFORD@SU-SIERRA.ARPA Guide for visitor from Lincoln Lab.?
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 1 Nov 84 13:10:28 PST
Date: Thu 1 Nov 84 13:12:35-PST
From: Ethan Bradford <BRADFORD@SU-SIERRA.ARPA>
Subject: Guide for visitor from Lincoln Lab.?
To: jmc@SU-AI.ARPA
Lincoln Lab. is investigating the possibility of setting up an AI research
group, and as part of that effort, they are studying what other major
research institutions are doing in the area of AI. Ken Senne, the leader
of the "Advanced Techniques" group here (at Lincoln Lab.), will be at
Stanford starting tomorrow. He is hoping to be able to meet with some
people who can clue him in as to what is going on at Stanford and perhaps
even give him some advice.
Do you know any graduate student (or professor) familiar with your general
area of research who would be willing to talk to him for a short while and
perhaps show him around? He'll be available Monday for meetings and he'll be
calling you up tomorrow to see if you have any suggestions as to who can help
him.
Any assistance in this area would be greatly appreciated! He's an interesting
fellow, so it should be pleasant to talk to him.
-- Ethan
-------
∂01-Nov-84 1430 RA*
You have a faculty meeting at 2:30 today.
∂01-Nov-84 1436 DAVIES@SUMEX-AIM.ARPA AI for Semiconductor Fabrication
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 1 Nov 84 14:36:00 PST
Date: Thu, 1 Nov 1984 14:36 PST
Message-ID: <DAVIES.12060181726.BABYL@Sumex>
From: DAVIES@Sumex
To: JMC@SAIL
Subject: AI for Semiconductor Fabrication
cc: Davies@Sumex
For the CIS Annual Review, I will be chairing a panel called "What Can
AI Do for Semiconductor Manufacturing?". I'm gathering background
material, including a summary of activity in this AI application.
In your travels, have you run into any projects involving AI for
semiconductor fabrication (excluding design)? I know of work at TI,
HP, Fairchild, and possibly Xerox. Do you know of any others, in the
U.S., Japan, Britain, or elsewhere?
-- Byron
∂01-Nov-84 1556 YM PhD Orals scheduling
To: JMC@SU-AI.ARPA
CC: ZM@SU-AI.ARPA, Waldinger@SRI-AI.ARPA, cheadle@SU-SCORE.ARPA
As a memebr of my reading committee you are expected to be on the orals
committee as well.
Since I need to schedule the Orals at least four weeks in advance and after
talking to Zoahr and Richard I want to schedule my orals on Monday 3-Dec
at 2pm.
Is this a good time for you? Otherwise can you suggest another time on the
same week?
Richard and Zohar prefer to have it in the afternoon.
Thanks,
Yoni Malachi.
∂01-Nov-84 1659 @SU-SCORE.ARPA:DEK@SU-AI.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 1 Nov 84 16:59:09 PST
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Thu 1 Nov 84 16:55:54-PST
Date: 01 Nov 84 1651 PST
From: Don Knuth <DEK@SU-AI.ARPA>
To: faculty@SU-SCORE.ARPA
I had my first opportunity to meet our new academic-affairs secretary
Victoria Cheadle today, and it dawned on me that she has been here
six weeks already. When I mentioned this, she said she really hasn't
had a chance to meet very many of the faculty yet, because she knows
we're all real busy; but she would really appreciate it if we would
stop in soon and introduce ourselves.
I think she's going to be a real super asset to our department, and
her job will be lots easier and more fun if she knows us as well as
the 400 or so students!
∂01-Nov-84 1751 SG invitation
To: JMC, CLT, ZM, RWW, YK
CC: SG, MS
We, sg and ms, are planning to invite you for a supper on some weekend.
As we wish to invite several people, we would like to know the dates
which are *not* convenient for you. Please choose the dates from the
following finite set.
{Nov 16 (Fri), Nov 17 (Sat), Nov 18 (Sun),
Nov 21 (Wed), Nov 22 (Thu), Nov 23 (Fri), Nov 24 (Sat), Nov 25 (Sun),
Nov 30 (Fri), Dec 01 (Sat), Dec 02 (Sun),
Dec 07 (Fri), Dec 08 (Sat), Dec 09 (Sun)}
The set of people we are planning to invite is:
{jmc, clt, zm, Mrs. zm, rww, yk}
Please edit the form below and send it to ms.
Shigeki Goto (sg)
Masahiko Sato (ms)
----------
The set of dates which are not convenient for me is:
{}
∂01-Nov-84 1829 cheriton@Pescadero Meeting next week
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 1 Nov 84 18:29:34 PST
Date: Thu, 1 Nov 84 18:28:02 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Meeting next week
To: csdfacilities@Pescadero
Given the excellent response and enthusiasm for next Thurs.
I propose we meet Nov. 8th , Thurs. at 2:45 pm.
Only Tom is unable to make that time - my apologies to him.
(Meeting room is not scheduled yet.)
I propose three agenda items, namely:
1. report on CSD-CF, including current and planned projects
plus expenditure of DARPA facilities money, etc.
OK, Len?
2. My workstation proposal.
3. Parallel computers, is there anything to say?
Anything else?
∂01-Nov-84 2025 BARWISE@SU-CSLI.ARPA Policy of military funding
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 1 Nov 84 20:25:17 PST
Date: Thu 1 Nov 84 20:22:32-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Policy of military funding
To: Research@SU-CSLI.ARPA
Here comes a draft of the policy on military funding. I got a rather
confused draft from Hans, one that contained various parts of various
drafts, but that was set aside when Pepe went to spain and Hans
finished up his thesis. I took it and tried to make it at least
coherent and one document. It is still far from finished, but it
seems it is at a stage where the exec committee can discuss it and
decide what to do next.
Remember that we need to get a draft to Kennedy and Drell early
in December.
-------
∂01-Nov-84 2208 CC.CLIVE@UTEXAS-20.ARPA HELP! Did you get the message I sent last week?
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 1 Nov 84 22:07:59 PST
Date: Fri 2 Nov 84 00:08:18-CST
From: Clive Dawson <CC.Clive@UTEXAS-20.ARPA>
Subject: HELP! Did you get the message I sent last week?
To: jmc@SU-AI.ARPA
Dear Prof. McCarthy--
I am trying to set up the panel for the "36-Bit Pioneers Round Table"
session at Anaheim DECUS in December. Did you get the message I sent
you last week? I realize that the subject line may have led you to
believe it was nothing other than a random announcement, so please
excuse the bit of extra drama in this one!
Clive
-------
∂02-Nov-84 0800 BARWISE@SU-CSLI.ARPA MM and the Funding document
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 2 Nov 84 08:00:07 PST
Date: Fri 2 Nov 84 07:54:46-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: MM and the Funding document
To: Research@SU-CSLI.ARPA
My message about the funding document is an example of why we need a
better mail system, one that does what you intend, not what you say.
I intended to send that message to the Executive committee, so they
can have a go at it, and then get a copy to all the researchers to
discuss, so that changes can be made before it goes off to Kennedy and
Drell. The latter are going to give talks about the issues at the
colloquium on Dec 6, and we wanted them to know how far our thinking
had gotten before their talk. Sorry about the confusion. Jon
-------
∂02-Nov-84 1154 RA
Did you get the material for the Hackers Conference which will take place
Nov. 9 to Nov. 11? If yes, do you intend to attend? Please let me know.
You can also call Patty Phelan in this matter. 331 5115
∂02-Nov-84 1344 @SU-CSLI.ARPA:GOGUEN@SRI-AI.ARPA Re: MM and the Funding document
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 2 Nov 84 13:44:34 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Fri 2 Nov 84 13:41:32-PST
Date: Fri 2 Nov 84 13:36:40-PST
From: Joseph A. Goguen <GOGUEN@SRI-AI.ARPA>
Subject: Re: MM and the Funding document
To: BARWISE@SU-CSLI.ARPA
cc: GOGUEN@SRI-AI.ARPA, research@SU-CSLI.ARPA
In-Reply-To: Message from "Jon Barwise <BARWISE@SU-CSLI.ARPA>" of Fri 2 Nov 84 07:56:42-PST
Jon,
From a simple-minded point of view, I think the basic problem here is
with the names of mailing lists: "research" is ambiguous; "researchers" would
be better; we already have "rc" for the research committee. Of course, it
would be better to have a mail system that understood the content of msgs and
thus could guess that the wrong mailing list had been requested; but there
are some interesting linguistic problems even with the choice of names. John
Carroll at IBM has written papers on how to choose good names for files in a
directory; the basic point is that such names have to be considered as part
of a *system* of names -- they should not be chosen in isolation.
Joseph
-------
∂02-Nov-84 1542 @SU-SCORE.ARPA:P.PIERRE@[36.48.0.1] A LOTS Vax.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Nov 84 15:41:58 PST
Received: from [36.48.0.1] by SU-SCORE.ARPA with TCP; Fri 2 Nov 84 15:36:54-PST
Date: 2 Nov 1984 15:33 PST (Fri)
Message-ID: <P.PIERRE.12060454139.BABYL@LOTSA>
From: Peter King <P.PIERRE@LOTSA>
To: faculty@score
Subject: A LOTS Vax.
LOTS has aquired the use of a VAX 11/780 running 4.2 BSD Unix for the
remainder of the quarter. We would like to provide it as a resource
for classwork. If anyone is interested in having his class use Ocelot
(as it is called), please contact me.
Since this VAX runs a different operating system from the DEC-20's, I
have not been able to set up the necessary protection devices to make
Ocelot as stable as our other systems. This means that our policies
regarding the VAX are less flexible. Our current policy is:
If a user of Ocelot does anything that violates the policies
of LOTS, or misuses the system or resources in any way, their
account will be removed.
This sounds harsh, I know, but when we have had the chance to make
it harder to break the rules, then we will soften the consequences.
In any case, we welcome the opportunity to provide you with an
alternative to TOPS-20.
Peter King
LOTS Student Coordinator
∂02-Nov-84 1625 RA
David chudnovski called. He'll try to call you later in the evening.
∂02-Nov-84 1630 LIBRARY@SU-SCORE.ARPA The B Newsletter (B Programming Language) Who is interested?
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Nov 84 16:30:01 PST
Date: Fri 2 Nov 84 16:22:22-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: The B Newsletter (B Programming Language) Who is interested?
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
I have just received number 1, August 1983 and number 2 June 1984 of the
B Newsletter from Mathematical Centre, Amsterdam. We also have a few reports
on the B language. It seems to me that someone asked me about this some
time ago. Is anyone interested in the B language?
Harry
-------
con-Nov-84 1649 GCOLE@SU-SCORE.ARPA Phone Company Lawsuit
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Nov 84 16:49:42 PST
Date: Fri 2 Nov 84 16:47:17-PST
From: George Cole <GCOLE@SU-SCORE.ARPA>
Subject: Phone Company Lawsuit
To: jmc@SU-AI.ARPA
(a) There is always the basic plea "res ipsa loquitor" -- by the fact itself
the phone company was negligent, since the person got injured. Cables
that could wrap around someone's neck when frayed and tear his flesh,
possibly cutting his jugular and killing him--why not carefully tested
plastic cables that would break or stretch and leave no sharp metal edges?
(b) There is another plea of 'foreseeable injury': surely the phone company
would realize people occasionally get furious while using pay phones and
might fling the receiver, etc. If a misuse is foreseeable, a company is
bound to design its product to minimize the harm that might result. Why
do you think all those little "S" signs have been plastered all over
the windows and glass doors of Stanford Dormitories?
In mitigation....
(c) Toro (*the lawnmakers*) successfully defended against a suit where
the suburbanite was using his lawnmower to trim the hedge, before he dropped it
on his foot.... That sort of injury was just not reasonable....
(d) The police sound like they would make wonderful witnesses for the
defense, and we can always hope that there won't be any lawyer greedy for a case
or desparate for one.... but if I were a local phone company lawyer, I'd advise
them to quietly request their insurers to prepare a small settlement reserve.
George S. Cole
-------
∂02-Nov-84 2158 TRACZ@SU-SIERRA.ARPA
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 2 Nov 84 21:58:40 PST
Date: Fri 2 Nov 84 22:00:51-PST
From: Will Tracz <TRACZ@SU-SIERRA.ARPA>
To: JMC@SU-AI.ARPA
cc: TRACZ@SU-SIERRA.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 30 Oct 84 16:06:00-PST
John: Thank's for the recommendation - would you care
to recommend any items on the menu? ----- Will
-------
∂02-Nov-84 2210 TRACZ@SU-SIERRA.ARPA
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 2 Nov 84 22:10:37 PST
Date: Fri 2 Nov 84 22:12:47-PST
From: Will Tracz <TRACZ@SU-SIERRA.ARPA>
To: JMC@SU-AI.ARPA
cc: TRACZ@SU-SIERRA.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 2 Nov 84 22:02:00-PST
John: Yum-Yum - That should do it - by the way is it worth while
to offer my opinions on the 'state-of-kitchen', or is it
a closed circle of referees? Thank's again. Will
-------
∂02-Nov-84 2216 TRACZ@SU-SIERRA.ARPA
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 2 Nov 84 22:16:26 PST
Date: Fri 2 Nov 84 22:18:37-PST
From: Will Tracz <TRACZ@SU-SIERRA.ARPA>
To: JMC@SU-AI.ARPA
cc: TRACZ@SU-SIERRA.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 2 Nov 84 22:13:00-PST
------- > t h a n k s <---------
-------
∂02-Nov-84 2221 ROB request for appointment
I would like to gain audience with your august personage at some point
to talk brifly about computer architecture, Stanford CSD admissions,
the PhD program, and me.
My schedule is fairly flexible. RSVP to ROB@SAIL, or
perhaps I should call you (or your sec'y) to set a time.
Danke.
- Rob [Poor]
∂02-Nov-84 2246 ME Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 2 November 1984
Previous Balance 40.66
Payment(s) 40.66 (check 10/13/84)
-------
Current Charges 1.90 (vending machine)
-------
TOTAL AMOUNT DUE 1.90
Please deliver payments to Rutie Adler, room 358, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Bills are payable upon presentation. Interest of 1.5% per month will be
charged on balances remaining unpaid 25 days after bill date above.
∂03-Nov-84 1533 HST thomas kurtz's address
hi john. i'm in cambridge for 6 days.do you know Dr.Kurtz phone
number (private or Dartmouth college)or his address(private) ?
herbert
∂04-Nov-84 0816 CLT watch out
for the pge manhole at the top of the drive!
if i hadn't tripped on the edge and fallen
across it i would have probable stepped
on the other edge and fallen in.
∂04-Nov-84 1635 HST pictures back
hi.I have the pictures with me here in booston.do you think i should
mail them to stanford?by the way - it occurred to me that i took only old
or fancy pictures and missed the "official" - say the normal most recent one.
herbert
∂04-Nov-84 1726 GOGUEN@SRI-AI.ARPA Course on Semantics of Computation
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 4 Nov 84 17:26:00 PST
Date: Sun 4 Nov 84 17:23:01-PST
From: Joseph A. Goguen <GOGUEN@SRI-AI.ARPA>
Subject: Course on Semantics of Computation
To: tw@SU-AI.ARPA, jmc@SU-AI.ARPA, john@SU-CSLI.ARPA, nilsson@SRI-AI.ARPA,
wasow@SU-CSLI.ARPA, barwise@SU-CSLI.ARPA
cc: goguen@SRI-AI.ARPA, meseguer@SRI-AI.ARPA
Hello gang:
Each of you has been involved in one way or another in trying to
help Pepe and I set up a class on semantics of computation at
Stanford. It now looks as if it is too late for the Winter quarter.
So we would to thank you all for your efforts so far, and ask you to
redirect them toward the Spring quarter; by then hopefully we will
also have SU faculty appointments, which will further our goal of
getting more involved with students.
Thanks again,
Joseph
-------
∂04-Nov-84 1808 forbus%uiucdcsb%uiuc.csnet@csnet-relay.arpa Re: page 11
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 4 Nov 84 18:07:56 PST
Received: from uiuc by csnet-relay.csnet id ac05590; 4 Nov 84 20:55 EST
Received: from uiucdcsb.Uiuc (uiucdcsb.ARPA) by uiucdcs.Uiuc (4.12/4.7)
id AA19544; Sun, 4 Nov 84 15:23:16 cst
Received: by uiucdcsb.Uiuc (4.12/4.7)
id AA18516; Sun, 4 Nov 84 15:20:17 cst
Date: Sun, 4 Nov 84 15:20:17 cst
From: Kenneth Forbus <forbus%uiucdcsb%uiuc.csnet@csnet-relay.arpa>
Message-Id: <8411042120.AA18516@uiucdcsb.Uiuc>
To: JMC%su-ai.arpa@csnet-relay.arpa
Subject: Re: page 11
Cc: forbus%uiucdcsb%uiuc.csnet@csnet-relay.arpa
First I'll defend the answer given, then carry your criticism even further.
1. To the level of detail that the system is represented, I will argue that
the answer to the oscillator question is correct. Without friction, adding
energy over time to the system means the total energy must increase. The
distance the spring extends increases as the total energy increases, since
at the point the spring fully extended, the energy of the system is all in
potential energy, and the energy in the spring depends on the internal
force, which in turn depends on the extension (see pages 72 and 73 for the
energy theory used, and page 65 for the model of elastic objects). If the
spring is breakable then there will be some length at which the break will
occur, and since the maximum extension over a cycle grows monotonically with
time, that length will be reached and the spring will break.
Using energy arguments brushes aside most of the details about how the
system is being driven. The idea is that in the course of qualitative
analysis certain questions will arise (such as "Is the energy gained by
pumping over a cycle less than, greater than, or equal to the energy lost to
friction over a cycle"), and how you answer those questions depends on what
other kinds of information one has and what one is doing. If one is lucky
enough to have tractable equations, for instance, then one might have an
exact answer. If an artifact is being designed, the answer which
corresponds to the desired behavior becomes a constraint placed on the
choices for the elements of that design. If we are watching a system, then
we can simply wait and see which behavior occurs (after considering where a
safe place to stand might be, based on the possibilities!).
Using the energy argument also avoids an important bug that almost everyone
involved in this game has at one point or another. Suppose your theory
predicts cyclic behavior, but the cycles include an arc which leads out to
another state (say, coming to rest). It is tempting to think that that arc
out must eventually be taken, but that assumption is not necessarily
correct. Going to an energy argument allows one to prove that the
transition does or doesn't occur.
I haven't thought about resonance phenomena, but I should. I bet that a
quite satisfactory qualitative account of it can be made.
2. There are, I think, pretty strong limits to how useful qualitative
reasoning is by itself. Johan and I could get away with envisioning when
thinking about fairly simple things, but envisioning falls apart when the
dynamical theory gets at all complex or when a system of more realistic
complexity is modelled. The choice of what information to use in pruning
possibilities when making prediction will, again, depend on what the task is
and what knowledge is available, but with luck there will be some
interesting theories to be had about the structure of that knowledge (Dedre
and I think "protohistories" might be involved in pruning, for instance).
The situation looks worse when you try qualitative reasoning about space.
The reason FROB worked so well was that the qualitative representation was
computed from a quantitative spatial representation. There just doesn't
seem to be a generally useful and powerful qualitative theory about shape,
in the sense that it allows a large number of questions to be answered
without recourse to an external theory.
Methodologically, I will argue that we are doing the right thing. By
considering qualitative reasoning "in isolation" we make clearer what it can
and cannot do. I think qualitative reasoning is probably the single most
important piece of an account of commonsense reasoning about the physical
world, but I don't think it is the only piece.
Going back to the oscillator example: Since I was thinking about a clock, I
imagined the form of the driving force to be an impulse given when the
potential energy was zero. QP theory doesn't allow direct influences to be
impulses. So I cannot model this phenomena directly, although an
encapsulated history could be written to describe it. I'm really leery
about adding a new kind of direct influence, but also about pushing the
problem off to encapsulated histories. Consider for example the "newtonian
balls" -- four balls on a string, where when you pull one off and let it
fly, only one ball comes out the other side. I haven't got a satisfactory
causal explanation of that yet, and there may not be one. I can make a
somewhat plausible account if (a) you assume that the balls always sit an
infintesimal distance apart and (b) impulsive momentum transfer is allowed,
but I'm not completely happy about either assumption.
∂04-Nov-84 2305 LLW@S1-A.ARPA Architectural Feast
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 4 Nov 84 23:04:59 PST
Date: 04 Nov 84 2237 PST
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: Architectural Feast
To: JMB@S1-A.ARPA, OTA@S1-A.ARPA, WRB@S1-A.ARPA, EAK@S1-A.ARPA,
EHJ@S1-A.ARPA, earl@S1-C.ARPA, gary@S1-B.ARPA, JDB@S1-A.ARPA,
SJC@S1-A.ARPA, HLD@S1-A.ARPA, taylor%ucbkim@UCB-VAX.ARPA
CC: LLW@S1-A.ARPA, PMF@S1-A.ARPA, jmc@SU-AI.ARPA
Gentlemen:
I was gently hassling PMF over the weekend re a fairly comprehensive
update on the Mark IIB architecture (counterattacking relative to his
estactic babbling over the latest cache coherency breakthrough), since my
ignorance is becoming ever more perfect on this entire subject and since
I've been promising JMC a chance to comment on this (the subject, not the
ignorance) for much too long.
Mikey agreed that Thursday at 1400 in the Conference Room seemed
reasonable. Could any of you who are interested in/willing to be present
and or presenting at such a session let JMB know if this would be a Good
Time, by COB Monday--I'd like for ACH to be present also, and I need to
ask for the time on his calendar soon. Either Jeff or I will then send
out a meeting call for this time, or else some other.
Thanks,
Lowell
∂05-Nov-84 1006 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 reminder
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 5 Nov 84 10:06:33 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Mon 5 Nov 84 10:05:04-PST
Date: Mon 5 Nov 84 10:03:37-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: F4 reminder
To: f4@SU-CSLI.ARPA, vardi@SU-CSLI.ARPA
There will be a project F4 meeting tomorrow at 3:15 in the Ventura
seminar room. We will be discussing chapters 3-5 of Gil Harman's
"Change of View". Those of you who haven't kept up with the reading
needn't bother about chapter 2, it is rather a bit of a digression
from the main theme of the book. To encourage some of you who didn't
come last time, or didn't stay, the chapters for this week have a more
"AI-ish" flavor, as they discuss in some detail particular principles
of belief revision.
--Bob
-------
∂05-Nov-84 1032 STAN@SRI-AI.ARPA several things
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 5 Nov 84 10:32:23 PST
Date: Mon 5 Nov 84 10:18:00-PST
From: STAN@SRI-AI.ARPA
Subject: several things
To: jmc@SU-AI.ARPA
cc: stan@SRI-AI.ARPA
Sorry about your not wanting to review papers; I understand, and
appreciate your candor. On a previous subject, what is Anne Gardner's
situation? You sent me a message a little while ago about her
possible interest in doing CBCL-related work. Can you give me
a little background? --Stan
-------
∂05-Nov-84 1101 @SU-CSLI.ARPA:withgott.pa@Xerox.ARPA string on finger
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 5 Nov 84 11:01:28 PST
Received: from Xerox.ARPA by SU-CSLI.ARPA with TCP; Mon 5 Nov 84 10:56:43-PST
Received: from Semillon.ms by ArpaGateway.ms ; 05 NOV 84 10:55:23 PST
Date: 5 Nov 84 10:55 PST
From: withgott.pa@XEROX.ARPA
Subject: string on finger
To: JMC@SU-CSLI.ARPA, GROSZ@SRI-AI.ARPA, WITHGOTT@SU-CSLI.ARPA
cc: withgott.pa@XEROX.ARPA, meseguer@SRI-AI.ARPA
Please send a one paragraph abstract of your research seminar talk to
Dikran@SU-CSLI.ARPA
cc: Meseguer@sri-ai.arpa, susi@su-csli.arpa
by Tuesday afternoon on these dates:
JOHN MCCARTHY: NOV 6 (for talk on 11/15)
MEG WITHGOTT: NOVEMBER 20 (for talk on 11/29)
BARBARA GROSZ: NOVEMBER 27 (for talk on 12/6)
THANKS!
(Mscl. information: Main speaker's presentation is ~45 minutes;
discussant's ~10. Regular meeting is at 2:15 every Thursday in Redwood.
This week's speaker is Phil Cohen, discussants Sag and Bratman.)
∂05-Nov-84 1138 RA
please call Bob Walinsky at UC Berkeley (57) 642 7034
∂05-Nov-84 1201 wilensky%ucbdali@Berkeley McCarthy's topic
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 5 Nov 84 11:59:50 PST
Received: from ucbdali.ARPA by UCB-VAX.ARPA (4.24/4.31)
id AA06663; Mon, 5 Nov 84 11:58:17 pst
Received: by ucbdali.ARPA (4.24/4.39)
id AA08489; Mon, 5 Nov 84 11:54:30 pst
Date: Mon, 5 Nov 84 11:54:30 pst
From: wilensky%ucbdali@Berkeley (Robert Wilensky)
Message-Id: <8411051954.AA08489@ucbdali.ARPA>
To: Bernard←Galler%UMich-MTS.Mailnet@MIT-MULTICS.ARPA
Subject: McCarthy's topic
Cc: jmc@su-ai
I just spoke with John McCarthy, who should confirm the following. He
will speak on New Generation Systems, but his theme will be the software
problem that arises in efforts to construct such systems.
"Bernard←Galler%UMich-MTS.Mailnet"@MIT-MULTICS.ARPA,"wilensky%ucbdali"@berkeley
McCarthy's topic
New generation computing, knowledge information processing and artificial
intelligence
The New Generation Computing system objective of moving to "knowledge
information processing systems" as proposed by Kazuhiro
Fuchi of ICOT has met quite general approval and motivates projects
all over this world. This lecture concerns
the problems of artificial intelligence that must be solved in order
to achieve the goal. The present rate of progress in achieving
computerization of common sense knowledge and common sense reasoning
isn't adequate to promise powerful knowledge information processing
systems by the 1990s. The lecture will identify some problems and
propose solutions for some and lines of research for others.
∂05-Nov-84 1313 RA
Arlene Conway called (703) 471 0920.
∂05-Nov-84 1400 JMC*
Spencer
∂05-Nov-84 1635 LLW@S1-A.ARPA Consulting Agreeements
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 5 Nov 84 16:35:36 PST
Date: 05 Nov 84 1630 PST
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: Consulting Agreeements
To: GAP@S1-A.ARPA, JIS@S1-A.ARPA
CC: LLW@S1-A.ARPA, JMB@S1-A.ARPA, PMF@S1-A.ARPA, jmc@SU-AI.ARPA
∂05-Nov-84 0921 JMC@SU-AI.ARPA ignorance, etc.
Received: from SU-AI.ARPA by S1-A.ARPA with TCP; 5 Nov 84 09:21:07 PST
Date: 05 Nov 84 0920 PST
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: ignorance, etc.
To: llw@S1-A.ARPA
CC: pmf@S1-A.ARPA
I can't come Tuesday or Thursday pm because of classes from 1:15 to 2:30.
Other days would be fine. However, because of having not received any
contract renewal, my badge has expired, so a special arrangement would
be necessary.
[Gloria/Joanne: Please give me a report by COB tomorrow on the present
status of *all* `O' Group consultant agreements, along with the name,
phone number and supervisor of whomever is handling these. Obviously, I'm
specifically interested in Professor McCarthy's, but I want to know about
all the others, as well. In any event, I want a new badge made up for Dr.
McCarthy, and a consultant agreement sent to him for his signature
immediately. Lowell]
∂05-Nov-84 1702 RA
I left a check from MAD on your desk.
∂05-Nov-84 1900 forbus%uiucdcsb%uiuc.csnet@csnet-relay.arpa Pumping and Intuition
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 5 Nov 84 19:00:17 PST
Received: from uiuc by csnet-relay.csnet id ac11740; 5 Nov 84 21:58 EST
Received: from uiucdcsb.Uiuc (uiucdcsb.ARPA) by uiucdcs.Uiuc (4.12/4.7)
id AA07247; Mon, 5 Nov 84 10:37:54 cst
Received: by uiucdcsb.Uiuc (4.12/4.7)
id AA02227; Mon, 5 Nov 84 10:34:44 cst
Date: Mon, 5 Nov 84 10:34:44 cst
From: Kenneth Forbus <forbus%uiucdcsb%uiuc.csnet@csnet-relay.arpa>
Message-Id: <8411051634.AA02227@uiucdcsb.Uiuc>
To: JMC%su-ai.arpa@csnet-relay.arpa
Subject: Pumping and Intuition
Cc: forbus%uiucdcsb%uiuc.csnet@csnet-relay.arpa
I'm quite aware of the physics involved; you missed the point of the first
part. The argument was NOT that ANY pumping mechanism would result in the
predicted behavior. The assumption made in the argument was that the
pumping added energy to the system. A specific mechanism for performing the
pumping was NOT described. Should a specific pumping mechanism fail to
satisfy this assumption, then of course the prediction will be wrong.
Otherwise, I still claim it holds.
As to your second point, I believe QP theory can be used to describe both
"untutored" and expert qualitative dynamics. The only known failing
concerns domains for which a device-centered ontology is more appropriate,
but you'll see that in the conclusions so I won't repeat it here. Johan and
I disagree on one other point, and that is the existence of "stutter"
(again, it's in the thesis). That phenomena convinced me James Allen was on
to a good thing with the "Meet" relation in his temporal logic. Otherwise,
as I argue in the thesis, the language provides a qualitative description of
differential equations, so it should be able to express many of the ideas of
physics properly.
∂05-Nov-84 2154 ROBERTA@SU-SCORE.ARPA phone call
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Nov 84 21:54:47 PST
Date: Mon 5 Nov 84 10:06:06-PST
From: Roberta Fisher <ROBERTA@SU-SCORE.ARPA>
Subject: phone call
To: McCarthy@SU-SCORE.ARPA
pls call Louise Peterson Re: A/V needs for talk on the 14th for CSI. 11/5 10:10A.
-------
∂05-Nov-84 2249 TAJNAI@SU-SCORE.ARPA IBM wine and cheese party
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Nov 84 22:49:24 PST
Date: Mon 5 Nov 84 12:12:35-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: IBM wine and cheese party
To: Faculty@SU-SCORE.ARPA, CSL-Faculty@SU-SIERRA.ARPA
cc: Ross@SU-SCORE.ARPA
The IBM wine and cheese party was so successful last year that Brent
Hailpern suggested another one this year.
Thursday, 4 to 6 p.m., Gold Lounge of the Faculty Club. (Nov. 8).
Dr. George Paul and Dr. Sadagopan of IBM Yorktown Heights will be
attending.
I do hope you will be able to stop by and enjoy the food and drink.
Keith Lantz is the faculty liaison for IBM, and his secretary, Valerie
Ross and I chose the menu. This can be a "dry-run" ("wet-run") for
the Forum Wine and Cheese Party scheduled for Thursday, Feb. 14.
Carolyn
-------
∂05-Nov-84 2351 LIBRARY@SU-SCORE.ARPA Journal of Intelligent Systems: Anyone interested?
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Nov 84 23:51:11 PST
Date: Mon 5 Nov 84 14:53:19-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Journal of Intelligent Systems: Anyone interested?
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA, buchanan@SUMEX-AIM.ARPA,
: ;
I have received very brief information on a journal to appear in 1985.
The Journal of Intelligent Systems will be published by Freund Publishing
House Ltd., London England for $120 per year, a quarterly. The editors
are Frank George, Les Johnson, and Mike Wright of Brunel University,
Uxbridge England. The managing editor is Mrs. Alison Lovejoy, AA
publishing Services, London England. The Aims and Scopes are described
as follows:
...to provide research and review papers on an interdisciplinary level, where
the focal point is the field of intelligent systems. This field includes:
the empirical study and modelling of natural intelligent systems (human
beings and also relevant studies in evolutionary theory and biology);
the theoretical analysis of possible systems which could display intelligence,
the development and enhancement of intelligent systems (eg learning theories)
the designing of intelligent systems (or the application of intelligent systems
concepts to the design of semi-intelligent machines) and the philosophical
aspects of the field of intelligent systems.
It is believed that technological advances in such areas as robotics and
knowledge based systems are facilitated by interdisciplinary communcication.
Additionally, those sciences which are concerned with the understanding of
human intelligence stand to gain by such a dialogue.
In keeping with the interdisciplinary intent of the journal, papers will be
written for general professional readership. It is therefore important
that technical jargon should be avoided, or it used , shld be made
explicit...........
An editorial board of 20 is being formed at present. If anyone has any
information or opinions about this publication, please let me know.
Does it sound like something I should order for the Math/CS Library.
Harry Llull
-------
∂06-Nov-84 0707 @MIT-MULTICS.ARPA:Bernard←Galler@UMich-MTS.Mailnet McCarthy's topic
Received: from MIT-MULTICS.ARPA by SU-AI.ARPA with TCP; 6 Nov 84 07:07:12 PST
Received: from UMich-MTS.Mailnet by MIT-MULTICS.ARPA with Mailnet id <2646053063897925@MIT-MULTICS.ARPA>; 06 Nov 1984 09:44:23 est
Date: Tue, 6 Nov 84 09:22:06 EST
From: Bernard←Galler%UMich-MTS.Mailnet@MIT-MULTICS.ARPA
To: JMC@SU-AI.ARPA
Message-ID: <539818@UMich-MTS.Mailnet>
Subject: McCarthy's topic
Sounds fine to me. But keep in mind the questions that I posed
in the proposal and try to work those in as well. Thank you.
∂06-Nov-84 0900 JMC*
kahn 694-5922
∂06-Nov-84 0912 PACK@SRI-AI.ARPA Industrial Lectureship Committee
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 6 Nov 84 09:12:15 PST
Date: Tue 6 Nov 84 09:09:32-PST
From: Leslie Kaelbling <PACK@SRI-AI.ARPA>
Subject: Industrial Lectureship Committee
To: jmc@SU-AI.ARPA
I am this year's student member of the Industrial Lectureship
Committee. Do you have meetings? When?
- Leslie
-------
∂06-Nov-84 0922 RA
I will be at a worksop this morning. Be back after lunch.
∂06-Nov-84 1046 ROBERTA@SU-SCORE.ARPA phone message
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Nov 84 10:46:30 PST
Date: Tue 6 Nov 84 10:43:40-PST
From: Roberta Fisher <ROBERTA@SU-SCORE.ARPA>
Subject: phone message
To: mccarthy@SU-SCORE.ARPA
pls call joanne w/lawrence liv lab at 422-7287. 11/6 10:45A.
-------
∂06-Nov-84 1233 RA
∂06-Nov-84 0959 JMC
What are these workshops?
Fundamentals of Grant and Contract Administration
∂06-Nov-84 1445 ROBERTA@SU-SCORE.ARPA mail
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Nov 84 14:45:09 PST
Date: Tue 6 Nov 84 14:23:17-PST
From: Roberta Fisher <ROBERTA@SU-SCORE.ARPA>
Subject: mail
To: mccarthy@SU-SCORE.ARPA
you have a large package at the 2nd floor recpt desk bldg 460. 11/6 2:25P.
-------
∂06-Nov-84 1530 RA Paula Bauman, Livermore
It's ok to come out Friday afternoon. You can bring the contract with
you. I left it on your desk.
∂06-Nov-84 1554 RA
Please call George Danzig 7-1304
∂06-Nov-84 1600 JMC*
Drell
∂06-Nov-84 1620 ROBERTA@SU-SCORE.ARPA phn ms
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Nov 84 16:20:44 PST
Date: Tue 6 Nov 84 16:17:35-PST
From: Roberta Fisher <ROBERTA@SU-SCORE.ARPA>
Subject: phn ms
To: mccarthy@SU-SCORE.ARPA
pls call meseduer re:seminar CSLI at 387-0188 or 859-3044. 11/6 4:20P.
-------
∂06-Nov-84 1631 RA Meeting at Xerox Wed., Nov. 7, @ 10:00
Doreen from Bill Spencer's office called to let you know that the meeting
which was scheduled for tomorrow must be rescheduled because the fellow
who was supposed to give the demonstration is going to be out. Two possibilities:
Mon. Nov 19, or Wed. Nov. 21. Please let Bill Spencer know what will be
convenient for you, or let me know and I will call his office.
∂06-Nov-84 1731 CLT
tue 27 nov 20:00 Kovanshchina SFO
∂06-Nov-84 2310 cheriton@Pescadero Re: Synapse
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 6 Nov 84 23:09:58 PST
Date: Tue, 6 Nov 84 23:07:41 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Re: Synapse
To: JJW@Sail, RPG@Sail, cheriton@SU-PESCADERO.ARPA
Cc: cheriton@Pescadero, jmc@su-ai
Here's my report.
The company looks real and healthy, and so does the machine.
We were hosted by Elliot Nestle, VP of hardware, who impressed me by
leveling with us wrt pro's and con's of the machine and keeping the
sales turkeys in their cage. I was impressed that they are using the
machine in-house for all their software development, or at least
such was the claim for one of the machines we saw.
My list of pros are:
0. The machine is adequate for our requirements. With 16 processors
(or even more) closely coupled to 16 meg. of shared memory,
one can certainly do a fast and interesting parallel lisp.
Moreover, it seems feasible to me to even go for a 28 processor
machine (since processors are/could be cheap) and explore parallel
processing issues beyond what others will touch for some time.
Note: 16 processors is basically 16 MIPS, which (if you stay away
from floating point) will clean the clock of the HEP.
1. Company is close and looks to me like it should survive.
They might even take off like a Tandem.
2. The machine is an example of the future. I believe there will
be lots of machines similar to the Synapse availale in a few
years, and for a lot less money. The fact that the Synapse is
real now means we are paying a premium for getting it now, but
the programming for it will be an investment in the future
(independent of whether Synapse as a company survives.)
In comparison, I think the HEP is a glitch in history, albeit
an interesting one.
3. The machine is built to be highly reliable. While we dont have an
immediate interest in that per se, it might save us a lot of time
and frustration. As we were told in Denver, it takes special
magic to fix a HEP. With Synapse, we could afford to have spare
processor boards. In general, performance and reliability are
the two big issues for multiprocessors. With Synapse we get
both.
4. We have lots of software for the 68000 architecture and experienced
people who know it at Stanford. After all, people are the critical
resource, right?
Well, that sounds all very wonderful. The cons are:
1. It looks like we need to supply an operating system for the beast,
or modify theirs. Their OS does not support multiple processes
in the same address space - need I say more. I would love to
port our software to this machine and solve all these problems.
However, being fair to ye and me, I cant guarantee this as support
for the qlambda work without staff support.
This seems to me to be the number one problem to consider
before buying the machine. In contrast, the HEP OS didnt appear to
be much of a help or hinderance, but one could multi-process
as required with it as is.
2. It doesnt help DARPA's goal of keeping Dennelcor alive, if that is
important.
3. The machine doesnt have demand paging at this point (although
that may be coming). However, with 16 meg. real, its not clear
we have a memory problem. There is a page-level mapping scheme
though.
4. The company is not "turned on" to AI applications and Lisp like
the HEP people.
5. They dont have an ethernet interface - but they said they would build
one for us. - Not a big deal.
6. The machine does not provide the 50 or so virtual processors of the HEP
and process switching will be more expensive. However, I think the
Synapse will give us a more realistic model of parallel processing.
In general, I think the machine is worth exploring. They gave us a list
price quote of $1 Meg. for 16 processors, 16 megabyte machine.
However, I think they would give us a much better deal, especially since
we are not buying all their software (database manager, etc.)
I would think going for a 28 processor machine for say $1 meg. would be
ideal.
However, the real issue is not price but people and support.
We need to find a viable solution to the OS problem.
Possibilities I see are:
1. I might be talked into supervising the port of the V kernel
and associated software for qlambda if we had a programmer to
do it and technical support from Synapse. Note that Unix
wouldnt provide the required processes in single address space
for this. In general, I would hope to do this if we got the
machine - just that we would need staff, not students, before
commiting to this (not terrribly) researchy task.
2. Dick Gabriel and Co. could write their own. The major scary part
is I/O, including network interface and all the protocols that go
with it - seems faster to me to port our software.
3. Convince Synapse to modify their operating system, or get a copy
of their code and modify it ourselves. I'm not interested in
being involved in this. Their OS right now is an unknown quantity
and their attitude to this suggested they might let us do it,
but I doubt they would be willing to do it for us. Besides
the unknowns associated with doing this, it is frightening to base
our work on a non-standard version of a proprietary OS that they
(almost definitely) wouldnt want to support, distribute or even
let us distribute.
Finally, of all the machines that are basically multi-microprocessor
machines with fancy caches, I dont think any are significantly better
in basic design than the Synapse. E.g. the Encore machine may be cheaper
and even slightly faster, but much later in coming.
So, I think a decision among the
various "S" companies, etc. should be based on other issues, like software,
delivery time, proximity, phase of moon, etc.
∂06-Nov-84 2349 JJW Sequoia
To: cheriton@SU-PESCADERO.ARPA, RPG@SU-AI.ARPA, JMC@SU-AI.ARPA
If anyone's interested, I have literature on Sequoia. They look a lot like
Synapse, including the emphasis on fault tolerance and transaction processing,
but they claim to allow up to 64 processors, and support Unix system calls in
their operating system. The price is in the same range as well.
∂07-Nov-84 0953 RA III
III board meeting will be Wed., December 5th. I already put it on your
calendar.
∂07-Nov-84 0954 RA
Robert Poor would like to meet with you today (he talked to you on the
telephone a while ago) he'll call later.
∂07-Nov-84 1005 @SU-SCORE.ARPA:cheriton@Pescadero Cancel the Ph.D. program quick!
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Nov 84 10:05:33 PST
Received: from Pescadero by SU-SCORE.ARPA with TCP; Wed 7 Nov 84 10:01:15-PST
Date: Wed, 7 Nov 84 10:01:13 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Cancel the Ph.D. program quick!
To: faculty@score
I was just talking to the Science Education portion of NSF. Because
we offer a Ph.D. in computer science, they cant provide any money for
educational equipment!!! I knew we were doing something wrong (or something
like that).
∂07-Nov-84 1006 cheriton@Pescadero Meeting tomorrow (Thurs).
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 7 Nov 84 10:06:21 PST
Date: Wed, 7 Nov 84 10:04:38 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Meeting tomorrow (Thurs).
To: csdfacilities@Pescadero
in the Chairman's conference room from 2:45 until the last dog is hung,
or 4:00 pm.
∂07-Nov-84 1047 HST history book - permission for reprint
hi john.i'm asking you in behalf of reprinting some of your old
papers and memos:my idea is to make a new book(thus cinrcumventing the battle
on the rights with the east german publisher).i would like to reprint:
1.the dartmouth proposal
2.some of the handwritten manuscripts
3.your "letters to the director of the computation center"
4.the acm proposal for an algorithmic language
5.your letter to perlis and turanski
6.early mit ai memos (1-8)
7.the 1.lisp manual (april 59)
8.the draft for the "recursive functions" paper
9.your "letter to the editor" (copy rights with acm ?)
i'm not sure about the lisp1 manual (too large).
i could present my material and the pictures first and give the reprints
as appendices.
what do you think?herbert
∂07-Nov-84 1142 ROBERTA@SU-SCORE.ARPA phn ms.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Nov 84 11:42:34 PST
Date: Wed 7 Nov 84 11:41:03-PST
From: Roberta Fisher <ROBERTA@SU-SCORE.ARPA>
Subject: phn ms.
To: McCarthy@SU-SCORE.ARPA
pls call Jose Meseguer at 859-3044 after 1:30P. 11/7 11:45P.
-------
∂07-Nov-84 1143 RA Recruiting
Allen Brown from General Electric would like to talk to you re his
recruiting trip to Stanford Thursday and Friday next week. His # (518) 386 8385.
∂07-Nov-84 1154 @SU-SCORE.ARPA:TW@SU-AI.ARPA Re: cancel the PhD program
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Nov 84 11:54:19 PST
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Wed 7 Nov 84 11:50:05-PST
Date: 07 Nov 84 1150 PST
From: Terry Winograd <TW@SU-AI.ARPA>
Subject: Re: cancel the PhD program
To: cheriton@SU-PESCADERO.ARPA
CC: faculty@SU-SCORE.ARPA
David,
I'm not sure what point you were making with your comment, but the policy
seems right to me, given that NSF is not just oriented to sponsoring new
research, but also has a responsibility to upgrade the overall quality of
scientific education in the country). Machines going to a small college
will have more impact on expanding (and ultimately improving) computer
science than adding a few more to what we already have here. Having a PhD
program is a rough-and-ready heuristic measure of being well enough
established that the marginal value of the extra machinery will be low.
∂07-Nov-84 1156 RA Nov. 19, meeting
The meeting is scheduled for Mon. November 19 @ 1:30pm
∂07-Nov-84 1237 CLT
LSPARC.RPG[UP,DOC]/65P ; catch introduction into maclisp
∂07-Nov-84 1324 JMB@S1-A.ARPA S-1 Mark IIB seminar
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 7 Nov 84 13:24:06 PST
Date: 07 Nov 84 1316 PST
From: Jeff Broughton <JMB@S1-A.ARPA>
Subject: S-1 Mark IIB seminar
To: jmc@SU-AI.ARPA, LLW@S1-A.ARPA
CC: GAP@S1-A.ARPA, PJB@S1-A.ARPA
How would Wednesday, Nov. 21 at 2:00pm suit you for an overview of the
Mark IIB architecture?
∂07-Nov-84 1649 RA Your ARPA account
I left a copy of this month projection of your ARPA account on your desk.
Betty said that you wanted to know whether you have enough money for three
students and additional $22,000 which apparently you have.
∂07-Nov-84 1707 CLT progress report
To: sf@SU-CSLI.ARPA, RWW@SU-AI.ARPA, JMC@SU-AI.ARPA
(progress on the part of the graduate office)
∂07-Nov-84 1615 CHEADLE@SU-SCORE.ARPA Chair of Oral Exam.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Nov 84 16:15:20 PST
Date: Wed 7 Nov 84 15:55:04-PST
From: Victoria Cheadle <CHEADLE@SU-SCORE.ARPA>
Subject: Chair of Oral Exam.
To: Ullman@SU-SCORE.ARPA
cc: Talcott@SU-SCORE.ARPA
Office: Margaret Jacks 258, 497-1519
I received notification from grad programs today that the Univ. chair
for your exam has been appointed. He is Rupert G. Miller, Jr., Professor
of Statistics.
Victoria
-------
∂07-Nov-84 1719 MS invitation
To: JMC, CLT, ZM, RWW, YK
CC: SG, MS
Thank you very much for letting us know the dates which are convenient for you.
The intersection of these sets turned out to be nonempty! It is, {Nov 16 (Fri),
Nov 17 (Sat)}.
We would like you to come to Shigeki Goto's apartment at 6:00 p.m. on Nov 16.
The address and telephone number are:
Shigeki Goto
3351 Alma St. #105, Palo Alto
Phone (415)856-4790
We are looking forward to seeing you then.
Shigeki Goto
Masahiko Sato
∂07-Nov-84 1923 TEX lektrisity
Our power will be off again 8:00 to 3:00 on Friday. I guess they did not finish.
∂07-Nov-84 2257 LLW@S1-A.ARPA Architecture, Etc.
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 7 Nov 84 22:57:31 PST
Date: 07 Nov 84 2249 PST
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: Architecture, Etc.
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA
∂07-Nov-84 1323 JMC@SU-AI.ARPA
Received: from SU-AI.ARPA by S1-A.ARPA with TCP; 7 Nov 84 13:23:15 PST
Date: 07 Nov 84 1329 PST
From: John McCarthy <JMC@SU-AI.ARPA>
To: jmc@S1-A.ARPA, llw@S1-A.ARPA, gap@S1-A.ARPA, pjb@S1-A.ARPA,
pmf@S1-A.ARPA
21st is fine with me for Mark IIB design review.
[John: I think they've scheduled it to start around 1300 or 1400; I'll
make sure that you get advance notice. I also understand that the
consultant agreement SNAFU is being straightened out at the present time.
I'm still pushing the security folks for the clearance. I haven't found
out yet whether I'll be able to get away for Jerry's upcoming meeting--do
you know what's on the agenda? Lowell]
∂08-Nov-84 0900 JMC*
Check on seminars csli and cis.
∂08-Nov-84 0930 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 8 Nov 84 09:30:55 PST
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Thu 8 Nov 84 09:27:09-PST
Date: 08 Nov 84 0920 PST
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
To: "@DIS.DIS[1,CLT]"@SU-AI.ARPA
Speaker: Prof. Alexander Kechris, Cal. Tech.
Title: Examples of Pi-1-1 sets and norms.
Place: Room 381-T, 1st floor Math. Corner, Stanford University
Time: Monday November 12, 4:15-5:30 p.m.
Abstract:
The main aim of the talk is to discuss situations in analysis
where ideas and results of descriptive set theory might be
relevant. In particular, we will survey a number of old and
new results which classify in the projective hierarchy various
natural examples, occuring in analysis, of sets in Polish spaces
(especially from real analysis, differentiation theory and the
theory of trigonometric series). In case a given set is
classified to be coanalytic (but not Borel) we will be also
concerned with the further problem of finding a coanalytic norm,
which assigns in a natural way a countable ordinal number to
each member of the set in question. This provides a canonical
ranking of the elements of the set and reveals its underlying
hierarchical structure.
There will be a no-host dinner at a local restuarant following
the talk.
S. Feferman
∂08-Nov-84 0935 RA Meeting w/Dr. Bil Hogan, VP Honeywell
Hogan will be out here next week and would like to meet with you re
joint venture research. Thursday morning is good for him, or Friday.
When can you meet him? Let me know and I'll call him back. If you want
to call, his # is (612)931 5980.
∂08-Nov-84 1024 pratt@Navajo Re: Professor Wu
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 8 Nov 84 10:24:05 PST
From: Vaughan Pratt <pratt@Navajo>
Date: 8 Nov 1984 1022-PST (Thursday)
To: gvax.gries@Cornell.ARPA (David Gries)
Cc: jmc@su-ai
Subject: Re: Professor Wu
In-Reply-To: gvax.gries@Cornell.ARPA (David Gries) /
Thu, 8 Nov 84 11:09:14 est.
<8411081609.AA27959@CORNELL-GVAX.ARPA>
I am very familiar with Professor Wu's outstanding recent work on practical
decision methods for the universal fragment of the theory of reals, and
especially its many applications to geometry. It has even
found application in such a mundane field as graphics for computer
workstations, at Sun Microsystems.
I would be honored to have the opportunity to talk with Professor Wu at
Stanford. Any time on November 19 is fine by me, all we need is to agree on
who will be the scheduler.
I wonder if Professor Wu would be interested also in seeing some of the
graphics research currently under way at Sun? It has a substantial
mathematical component, principally in projective geometry, that should appeal
to him.
-v
∂08-Nov-84 1031 gvax.gries@Cornell.ARPA Re: Professor Wu
Received: from CORNELL.ARPA by SU-AI.ARPA with TCP; 8 Nov 84 10:31:24 PST
Received: from CORNELL-GVAX.ARPA (gvax) by CORNELL.ARPA (4.30/4.30)
id AA10023; Thu, 8 Nov 84 13:32:05 est
Date: Thu, 8 Nov 84 13:30:53 est
From: gvax.gries@Cornell.ARPA (David Gries)
Message-Id: <8411081830.AA01904@CORNELL-GVAX.ARPA>
Received: by CORNELL-GVAX.ARPA (4.30/4.30)
id AA01904; Thu, 8 Nov 84 13:30:53 est
To: gvax.gries@Cornell.ARPA, pratt@Navajo
Subject: Re: Professor Wu
Cc: jmc@su-ai
I think he would be interested in anything that you sow him. A very talkative
feloow, very nice. Stay in contact with McCarthy, who asked him to
visit Stanford.
Thanks for responding.
david
∂08-Nov-84 1053 HULLMAN@SU-SCORE.ARPA annual report
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Nov 84 10:53:25 PST
Date: Thu 8 Nov 84 10:50:30-PST
From: Holly Ullman <HULLMAN@SU-SCORE.ARPA>
Subject: annual report
To: faculty@SU-SCORE.ARPA
cc: bscott@SU-SCORE.ARPA
Sorry to nag; this will be the last reminder. Do you have any changes
to make in your short biography as it appears in Carolyn Tajnai's 1984
forum report? Can be read <tajnai>annual.mss. Send them to me and I
can enter them.
Also, keep me informed about any honors, awards, etc. you've received.
Thanks,
Holly
-------
∂08-Nov-84 1350 minker@maryland Thanks for the Memories
Received: from MARYLAND.ARPA by SU-AI.ARPA with TCP; 8 Nov 84 13:50:24 PST
Received: by maryland.ARPA (4.12/4.7)
id AA04037; Thu, 8 Nov 84 16:48:59 est
Date: Thu, 8 Nov 84 16:48:59 est
From: minker@maryland (Jack Minker)
Message-Id: <8411082148.AA04037@maryland.ARPA>
To: JMC@SU-AI, Reiter.Ubc@csnet-relay.ARPA,
decvax\!watmath\!mhvanemden@Berkeley, henschen@ANL-MCS.ARPA
Subject: Thanks for the Memories
Cc: egkle@maryland
Dear John, Larry, Maarten and Ray,
We would like to thank you for participating in the
Artificial Intelligence and Logic week that we held at Mary-
land. We have finally recovered from all of the work needed
to prepare and run the Workshop and can now take time to
express our appreciation to you for all of your efforts.
We have heard nothing but pleasant remarks about all of
the lectures and discussion sessions held. The faculty from
the Mathematics Department were also enthused by the
Workshop as were the outside visitors and students. Several
of the mathematicians who attended were sufficiently turned
on to want to become researchers in topics discussed. Some
of the mathematicians worked up examples during the Workshop
to show that the McCarthy schema was not complete with
respect to minimal models and thereby augmented the example
given by Davis in the 1980 AI Journal.
We hope your trip back home was pleasant and that you
found your stay here as rewarding as it was to us.
Again, many thanks for all of your good work.
Best regards,
Jack and Don
!
∂08-Nov-84 1420 BSCOTT@SU-SCORE.ARPA Chris Goad
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Nov 84 14:19:54 PST
Date: Thu 8 Nov 84 14:14:35-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Chris Goad
To: JMC@SU-AI.ARPA
cc: RA@SU-AI.ARPA, BScott@SU-SCORE.ARPA
John, we've been asked by H & S to process termination papers for Chris Goad.
He has been on leave for a long time, but we never did terminate him. I
understood that it was possible he would return. Is it o.k. with you if we
process final termination papers for him?
Betty
-------
∂08-Nov-84 1503 RA
∂08-Nov-84 1450 JMC
Thursday morning any time between 10:30 and noon would be convenient to see Hogan.
He will come Thursday Nov. 15 @ 10:30.
∂08-Nov-84 1506 RA
Your meeting with Bil Hogan is set for Thursday, Nov. 15 @ 10:30. I put
in your cal file.
∂08-Nov-84 1512 RA Your participation in panel discussin, SJ State
Mike Dutton from San Jose State called re your participation in a
panel discussion on Friday Nov. 30 in the evening. The subject
is AI impact on Technology and Society with emphasis on social
implications. You can call him at (415) 694 5925 or (56) 266 6326,
or let me know and I'll call him,
∂08-Nov-84 2217 @SU-SCORE.ARPA:cheriton@Pescadero Re: cancel the PhD program
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Nov 84 22:16:55 PST
Received: from Pescadero by SU-SCORE.ARPA with TCP; Thu 8 Nov 84 22:13:55-PST
Date: Thu, 8 Nov 84 22:13:50 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Re: cancel the PhD program
To: TW@Sail, cheriton@SU-PESCADERO.ARPA
Cc: faculty@SU-Score
I totally disagree that "spending money on small colleges will have more
impact than adding a few more to what we already have here."
(However, I am willing to admit and encourage money to be spent on havenots
even though it may not yield as a good a return on investment.)
The fact is: we have very little for masters students other than a bunch
of Zenith terminals. I have had numerous employers and students remark
about the wide split between "research" computing and "educational"
computing at Stanford. I still think the NSF rule is crazy and even
discriminatory, but I dont think that "PhD'ism" will rally the troops.
∂08-Nov-84 2259 @SU-SCORE.ARPA:reid@Glacier Re: cancel the PhD program
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Nov 84 22:59:02 PST
Received: from Glacier by SU-SCORE.ARPA with TCP; Thu 8 Nov 84 22:52:24-PST
From: Brian Reid <reid@Glacier>
Date: 8 Nov 1984 2255-PST (Thursday)
To: David Cheriton <cheriton@Pescadero>
Cc: Faculty@Score
Subject: Re: cancel the PhD program
In-Reply-To: David Cheriton <cheriton@Pescadero> / Thu, 8 Nov 84 22:13:50 pst.
I agree with David. Stanford's academic computing facility is woefully
inadequate for teaching modern computer science. I wouldn't be at all
surprised if Foothill College had better per-student computer resources for
undergraduate and MS teaching than we do. Luckily our Ph.D. students
have enough sense to ignore the rules requiring them to use LOTS for
courses.
∂09-Nov-84 0855 BSCOTT@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 08:55:10 PST
Date: Fri 9 Nov 84 08:48:38-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 8 Nov 84 14:46:00-PST
O.K., John. We won't process any paperwork for Chris until I hear further
from you.
Betty
-------
∂09-Nov-84 0902 LIBRARY@SU-SCORE.ARPA Lisp Conferences
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 09:02:08 PST
Date: Fri 9 Nov 84 09:00:40-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Lisp Conferences
To: jmc@SU-AI.ARPA
John,
Thank you very much. Would you like for me to pick them up at your
office? We have had so many people asking for the 1982 one and can't
seem to buy one.
Harry
-------
∂09-Nov-84 1153 MESEGUER@SRI-AI.ARPA your talk
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 11:53:12 PST
Date: Fri 9 Nov 84 11:52:48-PST
From: MESEGUER@SRI-AI.ARPA
Subject: your talk
To: jmc@SU-AI.ARPA
cc: withgott@XEROX.ARPA, meseguer@SRI-AI.ARPA
John,
This is to remind you that we need an abstract for your forthcoming
talk at the csli seminar next Thursday Nov. 15th. It has been costumary
to have a 45 min. talk followed by 10 min. comments by a "commentator",
followed by 15 min. question and answer period. We will also need the name
of the person whom you would like to have as your commentator.
It is my understanding that, because of a course you are teaching your
talk could not start until 2:30. Is this the correct time?
Please, let us (Meg Withgott and me) know as soon as possible, so that
your talk can be advertised.
Jose Meseguer.
-------
meseguer%sri-ai
my talk
Sorry about delay in title and abstract. I have to confess that I somehow
got this commitment mixed up with talking to CIS on the previous day.
There are several things I could talk about, and it really should depend
to some extent on who goes to those seminars. I'm tempted, imagining that
linguists are in the audience, to use the following title and abstract
Natural language from the Standpoint of Artificial Intelligence
Abstract: An intelligent individual, human or computer program, must
act on the basis of what it believes in advance modified by what it
observes and what it learns from linguistic communication. Thinking
about how the achievement of goals is helped by communication leads
to a somewhat different point of view from one derived mainly from
study of the corpus of spoken and written language. Namely,
1. Communication should be regarded as a modifier of state of mind.
2. The most basic form of communication is the single word sentence
uttered under conditions in which the speaker and hearer share enough
knowledge so that the single word suffices. The complete sentence
develops under conditions in which the speaker and the hearers share
less context.
3. Many of the characteristics of language are determined by so far
unrecognized requirements of the communication situation. They will
apply to machines as well as people.
4. An effort to make a Common Business Communication Languages for
for commercial communication among machines belonging to different
organizations exhibits interesting problems of the semantics of
language.
**** end of abstract
This talk would be somewhat off the cuff. If linguists aren't likely
to come, I could talk about "Modifying programs without reading them"
or about "Non-monotonic reasoning" or "Formalizing common sense knowledge".
Please phone me if you think something other than the natural language
talk would be better.
2:30 is the right time. If you decide to go ahead with this title and
abstract, let me and CSLI know.
∂09-Nov-84 1159 Allen.PA@Xerox.ARPA Confirmation of Kurzweil Demo Date
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 11:59:38 PST
Received: from Chardonnay.ms by ArpaGateway.ms ; 09 NOV 84 11:59:25 PST
Date: 9 Nov 84 11:39:14 PST (Friday)
From: Allen.PA@XEROX.ARPA
Subject: Confirmation of Kurzweil Demo Date
To: JMC@SU-AI.ARPA
cc: Diebert.PA@XEROX.ARPA, Ritchie.PA@XEROX.ARPA, Spencer.PA@XEROX.ARPA,
Allen.PA@XEROX.ARPA
I believe that Monday, 19 November, works with everyone's schedule for
this much delayed demonstration. Can we make this for 2:30 p.m. as
Spencer had made a lunch commitment I wasn't aware of when I said 1:30.
Thanks,
Dorene
2:30 is fine with me - John
∂09-Nov-84 1302 MESEGUER@SRI-AI.ARPA Re: my talk
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 13:02:22 PST
Date: Fri 9 Nov 84 13:01:58-PST
From: MESEGUER@SRI-AI.ARPA
Subject: Re: my talk
To: JMC@SU-AI.ARPA
cc: withgott@XEROX.ARPA, meseguer@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 9 Nov 84 12:50:00-PST
John, the title and abstract you sent are just perfect for the audience
of the csli seminars. The seminars are addressed to all csli members and
there is a conspicuous linguistic subset.
We still will need a commentator whenever you have decided on that.
-------
∂09-Nov-84 1324 SJG disagreement
I lack the ability to defend the former, and find the latter too boring.
Anyway, I suspect you will find more to disagree with --
Matt
∂09-Nov-84 1351 minker@maryland Counterexamples
Received: from MARYLAND.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 13:50:55 PST
Received: by maryland.ARPA (4.12/4.7)
id AA02405; Fri, 9 Nov 84 16:49:35 est
Date: Fri, 9 Nov 84 16:49:35 est
From: minker@maryland (Jack Minker)
Message-Id: <8411092149.AA02405@maryland.ARPA>
To: JMC@SU-AI
Subject: Counterexamples
Cc: perlis@maryland
Dear John,
In response to your message, the following two examples
were provided by individuals at the AI and Logic Workshop. We
have not seen the full details of their proofs to verify their examples,
but provide only a sketch based on what they told us.
1.The following example is due to John Schlipf, a former PhD
graduate of Jon Barwise who is now at the University of Cincinnati.
Let DLO be the theory of dense linear reflexive orderings,
'<', without endpoints. Let P satisfy the additional axioms
A[P]: Px--> (y).-Py--> x<y and
-(Ex)[(Px & (y).Py--> y<x) v (-Px & (y).-Py--> x<y)].
That is, P entities are less than -P entities, and there are no extremal
points to the P entities or -P entities. It follows that there are no
P-minimal models of the theory T[P] = DLO+A[P], and yet T[P]*,
the circumscriptive closure of T[P], is consistent
since circumscription yields nothing here: there are no definable
subsets of the domain of a model, so any model of T[P] is a model of
T[P]*.
2.David Kueker, a logician in the Mathematics Department at
Maryland, provides the following illustration: Let I[P] be the theory
{P0, Px<-->Psx, 0 =/=sx, sx=sy-->x=y}.
Then models of I[P] are of two types: those that satisfy the sentence,
(x)[-(Ey)x=sy --> x=0]
and those that do not. But the extension of P in any minimal model
is isomorphic to the natural numbers N, and is of the former type.
Kueker has shown that this sentence is not a theorem of the
circumscriptive closure of I[P]. The obvious candidate for Zx in
the circumscriptive schema, namely
Px &. -(Ey)x=sy--> x=0,
achieves nothing.
It was commented at the Workshop on the basis of these examples
that definability rather than arithmetic seemed to be the point of
breakdown of completeness.
Best regards,
Jack and Don
∂09-Nov-84 1414 MESEGUER@SRI-AI.ARPA discussant
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 14:14:23 PST
Date: Fri 9 Nov 84 14:13:56-PST
From: MESEGUER@SRI-AI.ARPA
Subject: discussant
To: JMC@SU-AI.ARPA
cc: meseguer@SRI-AI.ARPA
John,
Ned Block would like to be the one, but will be in Miami this coming
Thursday. Bob Moore has agreed to be your discussant.
I will take care of advertising the abstract, time and discussant.
For my own peace of mind, could you send a little reply back
letting me know that (if) everything is ok as arranged?
-------
∂09-Nov-84 1434 LIBRARY@SU-SCORE.ARPA New Books in the Math/CS Library
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 14:34:19 PST
Date: Fri 9 Nov 84 14:30:44-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: New Books in the Math/CS Library
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
Readings on Cognitive Ergonomics--Mind and Computers. Proceedings of the 2nd
European Conference Austria, Sept. 1984 QA76.9.P75C64 1984
Programming Languages and Their Definition by H. Bekic QA76.7.B45 1984
Automated Theorem Proving: After 25 Years by Bledsoe and Loveland
QA76.9.A96S64 1983
Artificial Intelligence and Information-Control Systems of Robots. Proceedings
of the Third International Conference on Artificial Intelligence and
Information-Control Systems of Robots Czechoslovakia, 1984. ed by Plander
Q334.I55 1984
Artificial Intelligence Expert Systems Computer Vision and Natural Language
Processing by Gevarter Q335.G48 1984
Intelligent Information Retrieval: Informatics 7. Proceedings of a conference
held by the Aslib Infromatics Group and the Information Retrieval Group of the
British Computer Society March 1983. ed. by Kevin Jones
Restricted Principles of Computing Processes (PCP) and Equations in Free
Semigroups. by Karpinski QA402.5.R4 1981
Program Transformation and Programming Environments by Bauer and Remus
QA76.6.N377 1983
Current Practices in Software Development by King QA76.6K565 1984
Office Automation by Doswell HF5548.2.D63 1983
Ada: Language, Compilers and Bibliography by Rogers QA76.73.A35A29 1984
Decision Tables and Computer Programming by Welland QA76.6 W44
Text Processing by Day QA76.9T48D38 1984
Systems Development Without Pain by Ward QA76.9.S88W37 1984
Using and Programming the Macintosh; including 32 Ready-to-run programs
by Holtz QA76.8.M3H65 1984
Using the IBM Personal Computer: Organization and Assembly Language
Programming by Franklin QA76.8.I2594F73 1984
Interfacing to the IBM Personal Computer by Eggebrecht TK7889.I26E44 1983
UNIX Primer Plus by Waite, Maritin and Prata QA76.6W3185 1983
Harry Llull
-------
∂09-Nov-84 1451 LIBRARY@SU-SCORE.ARPA Lisp 1984
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 14:45:53 PST
Date: Fri 9 Nov 84 14:38:18-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Lisp 1984
To: jmc@SU-AI.ARPA
I am ordering that rush so we should have no problem getting it without
photocopying. I will drop by early next week and pick by the 1980 and
1982.
Harry
-------
∂09-Nov-84 1549 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 15:49:26 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Fri 9 Nov 84 15:48:03-PST
Date: Fri 9 Nov 84 15:47:13-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: next F4 meeting
To: f4@SU-CSLI.ARPA
The next meeting of project F4 will be Tuesday, Nov. 20, at 3:15 in
the Ventura seminar room. We will be discussing chapters 5-7 of
Gil Harman's "Change in View". (Chapter 5 was scheduled to be
discussed at the last meeting, but we didn't get to it.) We will
finish up the Harman manuscript at the following meeting.
In case there is any confusion, we sticking to our original biweekly
schedule. Some of you may have heard that we were going to slip the
schedule by one week because of "Emotions week", but that plan was
abandoned because of other conflicts.
-------
∂09-Nov-84 1604 RA
Decus Conventionin Anaheim
Clive Dawson from MCC Austin called re his invitation to you to participate
in the above. He needs to know by Monday. Send him electronic mail. His
phon # at home is (512)892 2222.
∂09-Nov-84 1607 BMOORE@SRI-AI.ARPA [Bob Moore <BMOORE@SRI-AI.ARPA>: research activities]
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 16:07:00 PST
Date: Fri 9 Nov 84 16:05:54-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: [Bob Moore <BMOORE@SRI-AI.ARPA>: research activities]
To: bratman@SU-CSLI.ARPA, pcohen@SRI-AI.ARPA, georgeff@SRI-AI.ARPA,
konolige@SRI-AI.ARPA, jmc@SU-AI.ARPA, bmoore@SRI-AI.ARPA,
nissenbaum@SU-CSLI.ARPA, john@SU-CSLI.ARPA, stan@SRI-AI.ARPA,
zalta@SU-CSLI.ARPA, vardi@SU-CSLI.ARPA
Many of you have not responded to this message. Please do so as soon
as possible. (Moshe, I know you haven't seen this before.)
--Bob
---------------
Date: Wed 24 Oct 84 11:41:41-PDT
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: research activities
To: bratman@SU-CSLI.ARPA, pcohen, georgeff, konolige, jmc@SU-AI.ARPA,
bmoore, nissenbaum@SU-CSLI.ARPA, john@SU-CSLI.ARPA, stan,
zalta@SU-CSLI.ARPA
This message is being sent to everyone who is officially on CSLI
project F4, "Thought, Action, and the Commonsense World." The
executive committee has asked for a report on what actual research is
going on in each project, so could you each please send me a few
sentences about what research you are doing that falls under this
project. Those who are receiving salary support through CSLI should
take this very seriously, since there will have to be budget cuts next
year, and I would not want to be in the position of not having claimed
to be doing any research when those decisions are made. To refresh
your memory, the following is the "official" description of the
project:
Project F--4. Thought, Action, and the Common Sense World
A premise underlying this project is that theories of thought, action
and the common sense world cannot be profitably developed
independently of each other. Language is a type of action that
expresses thought and, at the same time, conveys information.
Understanding language and information thus requires understanding
thought, action and intentional phenomena in general. For instance,
the development of viable theories of the use of language for
communication requires an understanding of the underlying notions of
action and intention. Moreover, a theory of common sense incorporates
a theory of action (together with a theory of the world.). A theory of
common sense is itself of interest for a number of reasons; chief among
them is the following one: though common sense itself may be
unscientific because of its very nature, it is clearly what enables
humans, in large part, to cope with a complex world. It follows from
this centrality of common sense reasoning that any scientific
understanding of human thought and action and any system that
successfully interacts with humans will have to incorporate an
understanding of such ordinary conceptions, even if based on
conceptions radically different from the common sense ones.
-------
-------
∂09-Nov-84 1613 CC.CLIVE@UTEXAS-20.ARPA 36-Bit Pioneers Roundtable invitation
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 16:13:34 PST
Date: Fri 9 Nov 84 18:11:51-CST
From: Clive Dawson <CC.Clive@UTEXAS-20.ARPA>
Subject: 36-Bit Pioneers Roundtable invitation
To: jmc@SU-AI.ARPA
Prof. McCarthy-
I am still trying to finalize the panel for the Pioneers session at
DECUS in Anaheim. Since time is running short I will need to contact
some of the alternatives on the list rather quickly if it turns out you
can't make it. It would be most helpful if you could let me know by
Monday whether or not you can make it (or that you need more time to
decide).
Thanks,
Clive Dawson
-------
∂09-Nov-84 1636 MADSEN@SU-CSLI.ARPA Workshop invitation
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 16:36:30 PST
Date: Fri 9 Nov 84 16:34:02-PST
From: Ole Lehrmann Madsen <MADSEN@SU-CSLI.ARPA>
Subject: Workshop invitation
To: WSMAIL: ;
cc: trudy@SU-CSLI.ARPA
INVITATION TO A CSLI WORKSHOP ON THE SEMANTICS OF PROGRAMS
We are planning to hold a workshop on the semantics of programs on
Tuesday, December 4, as described in detail below. We are keeping
attendance limited, so we can keep discussions more productive. We are
inviting a small number of people from Stanford and the surrounding
industrial laboratories, and would be pleased if you could participate.
If you are interested in attending, please respond to Trudy Vizmanos at
CSLI (Trudy@SU-CSLI, phone 497-1839) by Wednesday, Nov. 21, so we can plan
for the right number of people and can send you any further materials. If
you have any questions regarding the workshop, contact Terry Winograd
(TW@SU-SAIL, phone 497-2780) or Ole Lehrmann Madsen (Madsen@SU-CSLI, phone
497-0364). You should also let Trudy know if you need a ride to the
conference location or if you are able to have other people ride with
you.
We hope to see you there.
Ole Lehrmann Madsen
Terry Winograd
CSLI workshop on the semantics of programming
December 4, 1984
The Center for the Study of Language and Information was created with the
goal of bringing together researchers in natural language and
computation, to develop together new theoretical directions in the study
of language and information.
One of our central concerns
is semantics -- how forms in a language can be characterized
as conveying meaning in relation to some world of concern. There are
long-standing traditions for the study of natural language semantics, and
CSLI projects are extending and reinterpreting them. There is a
briefer, but substantial, tradition for the study of the semantics of
programming languages. It includes approaches described as denotational
semantics, algebraic semantics, axiomatic semantics, operational
semantics, Petri nets, etc.
Over the past few months, there have been a series of presentations and
discussions in various groups within CSLI, at which we have tried to better
understand the similarities and differences between the semantic accounts
of natural and computational languages. We are at a point where some
substantive issues are beginning to emerge and we feel that a concentrated
day of discussion including people within and outside of the
center has great potential to further our thinking. In particular, many
of us feel that theories of natural language semantics have raised
a number of issues, of which only some have received adequate attention
in the semantics of programming languages. Our question is not how
to do better what programming language semantics already does, but how
to do something different that better accounts for the relation between
programs and the world in which the machines running them are embedded.
We are inviting a number of people from the local area whom we believe
have relevant experience and insights. We have planned a day-long meeting
at a place far enough removed from our everyday work that we can really
devote our attention and energies to the topic. The day will be divided
into four sessions of about an hour and a half. Each session will begin
with a presentation, followed by a prepared response, then open
discussion. Continental breakfast and lunch will be provided.
Below is a schedule of the program. The responders have not yet been
determined.
---------
Schedule:
8:30-9:00 Coffee and Pastries
9-10:30 Session 1
Presenter: Joe Goguen
Topic: Semantics of programming languages: the formal approach
10:30-10:45 Break
10:45-12:15 Session 2
Presenter: Jon Barwise
Topic: Situation semantics: what is new and what are the
parallels?
12:15-1:30 Lunch
1:30-3 Session 3
Presenter: Terry Winograd
Topic: Representational semantics: how programs represent
the world
3-3:30 Break
3:30-5 Session 4
Presenter: Peter Deutsch
Topic: Object oriented languages: how are they different?
---------
Location: The Bach Dancing and Dynamite Society, Princeton CA (a suburb
of Half-Moon Bay, about a half-hour drive from Palo Alto) - map will be sent
and we will help coordinate carpoooling.
-------
∂09-Nov-84 1649 @SU-SCORE.ARPA:MADSEN@SU-CSLI.ARPA Workshop announcement
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 16:49:48 PST
Received: from SU-CSLI.ARPA by SU-SCORE.ARPA with TCP; Fri 9 Nov 84 16:37:26-PST
Date: Fri 9 Nov 84 16:36:18-PST
From: Ole Lehrmann Madsen <MADSEN@SU-CSLI.ARPA>
Subject: Workshop announcement
To: bboard@SU-CSLI.ARPA, cinterest@SU-CSLI.ARPA, sdlg@SU-CSLI.ARPA,
faculty@SU-SCORE.ARPA
cc: trudy@SU-CSLI.ARPA
ANNOUNCEMENT OF CSLI WORKSHOP ON THE SEMANTICS OF PROGRAMS
The following is a description of a workshop organized by CSLI to be held
on Tuesday, December 4. We have decided to limit the number of
participants in order to make the discussions more productive. If you are
interested in being invited to the workshop you should send mail to Ole
Lehrmann Madsen (Madsen@SU-CSLI). If you have any questions regarding the
workshop you may contact Terry Winograd (TW@SU-SAIL) or Ole Lehrmann
Madsen.
CSLI workshop on the semantics of programming
December 4, 1984
The Center for the Study of Language and Information was created with the
goal of bringing together researchers in natural language and
computation, to develop together new theoretical directions in the study
of language and information.
One of our central concerns
is semantics -- how forms in a language can be characterized
as conveying meaning in relation to some world of concern. There are
long-standing traditions for the study of natural language semantics, and
CSLI projects are extending and reinterpreting them. There is a
briefer, but substantial, tradition for the study of the semantics of
programming languages. It includes approaches described as denotational
semantics, algebraic semantics, axiomatic semantics, operational
semantics, Petri nets, etc.
Over the past few months, there have been a series of presentations and
discussions in various groups within CSLI, at which we have tried to better
understand the similarities and differences between the semantic accounts
of natural and computational languages. We are at a point where some
substantive issues are beginning to emerge and we feel that a concentrated
day of discussion including people within and outside of the
center has great potential to further our thinking. In particular, many
of us feel that theories of natural language semantics have raised
a number of issues, of which only some have received adequate attention
in the semantics of programming languages. Our question is not how
to do better what programming language semantics already does, but how
to do something different that better accounts for the relation between
programs and the world in which the machines running them are embedded.
We are inviting a number of people from the local area whom we believe
have relevant experience and insights. We have planned a day-long meeting
at a place far enough removed from our everyday work that we can really
devote our attention and energies to the topic. The day will be divided
into four sessions of about an hour and a half. Each session will begin
with a presentation, followed by a prepared response, then open
discussion. Continental breakfast and lunch will be provided.
Below is a schedule of the program. The responders have not yet been
determined.
---------
Schedule:
8:30-9:00 Coffee and Pastries
9-10:30 Session 1
Presenter: Joe Goguen
Topic: Semantics of programming languages: the formal approach
10:30-10:45 Break
10:45-12:15 Session 2
Presenter: Jon Barwise
Topic: Situation semantics: what is new and what are the
parallels?
12:15-1:30 Lunch
1:30-3 Session 3
Presenter: Terry Winograd
Topic: Representational semantics: how programs represent
the world
3-3:30 Break
3:30-5 Session 4
Presenter: Peter Deutsch
Topic: Object oriented languages: how are they different?
---------
Location: The Bach Dancing and Dynamite Society, Princeton CA (a suburb
of Half-Moon Bay, about a half-hour drive from Palo Alto) - map will be sent
and we will help coordinate carpoooling.
-------
∂09-Nov-84 1709 @SU-SCORE.ARPA:pratt@Navajo NSF and education
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 17:09:30 PST
Received: from Navajo.ARPA (SU-NAVAJO.ARPA.#Internet) by SU-SCORE.ARPA with TCP; Fri 9 Nov 84 17:05:39-PST
Date: Fri, 9 Nov 84 17:05:37 pst
From: Vaughan Pratt <pratt@Navajo>
Subject: NSF and education
To: faculty@score
Cc: bscott@score
I realize now that I don't know the NSF's position on funding education as
opposed to research. I had the impression that they wanted higher
education paid out of tuition and voluntary contributions rather than the
taxpayers' pockets, and that they were concentrating on basic research because
that's where private support was weakest. Would somebody who has the NSF's
position down pat please verify or correct my impression? A word about
their position on the appropriateness of using research funds to pay the
tuition of RA's would be appreciated too.
-v
∂09-Nov-84 1716 ullman@diablo Bell awards
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 17:16:13 PST
Date: Fri, 9 Nov 84 17:16:54 pst
From: Jeff Ullman <ullman@diablo>
Subject: Bell awards
To: jmc@sail, tw@sail, wiederhold@sumex
Aho told me that I will receive support for Upfal.
I assume this means they are not going to fund any other proposals
from Stanford, or at least you should have heard by now if they were.
Remember though, that there is still the IBM money, which I believe
is going begging.
∂09-Nov-84 1822 @SU-SCORE.ARPA:JMC@SU-AI.ARPA NSF and education
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Nov 84 18:22:37 PST
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Fri 9 Nov 84 18:20:06-PST
Date: 09 Nov 84 1721 PST
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: NSF and education
To: faculty@SU-SCORE.ARPA, bscott@SU-SCORE.ARPA
NSF's position is ultimately determined by Congress. From time to time,
Congress has appropriated money for various educational programs to be
run by NSF. NSF will cheerfully provide any number of brochures on the
programs that exist and what Congressional initiatives they correspond
to. No doubt the relevant officials, e.g. Kent Curtis, will respond
to telephoned inquiries. Speculation is pointless.
∂10-Nov-84 0035 GENESERETH@SUMEX-AIM.ARPA Re: Confirmation of Kurzweil Demo Date
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 10 Nov 84 00:35:52 PST
Date: Sat 10 Nov 84 00:32:22-PST
From: Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>
Subject: Re: Confirmation of Kurzweil Demo Date
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 9 Nov 84 12:10:00-PST
Unfortunatley, I have a meeting at 3:00 at Stanford. I can move it
if absolutely necessary but it involves moving a handful o other
people as well.
mrg
-------
∂10-Nov-84 0900 JMC*
essays+call David
∂10-Nov-84 1133 cheriton@Pescadero Minutes: CSD facilities meeting on No.v 8th
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 10 Nov 84 11:33:21 PST
Date: Sat, 10 Nov 84 11:31:59 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Minutes: CSD facilities meeting on No.v 8th
To: csdfacilities@Pescadero
The CSD facilities met Nov. 8th at 2:45-4:00pm with Cherition,
McCarthy, Weening, Mogul, Bosack and DelaHunt present.
The basic minutes were as follows:
1. Buchanan request for space for TI PC's for a Lisp course in the
winter quarter. We decided I (DRC) would volunteer use of my
teaching lab space in ERL for this. We couldnt think of any
alternatives in MJH.
2. Len Bosack reported in CSD-CF:
a. They were expecting to break even this year, not lose money.
b. MacSun project was coming along with expected cost of
$1200/channel. Future decision as to how many channels the
dept. should buy to replace datadisks.
c. Hiring of Unix support person was stalled in the Dean's office
at present - likely candidate is Mike Rubin.
d. 10 Mb Meis exists and should be in use soon.
e. Plan for more ethertips and hope to rewrite ethertip software
to improve response and use TCP.
f. Hardware exists to replace Golden - problem is software.
Either BBN will supply or Philip Almquist will write our own.
Len promised this would be done by next August (actually he
imagined that this could be possible.)
g. Labrea, the file server should be on deck soon, once the DEC
junk gets here. So will Carmel.
3. Parallel Computation/support - deferred since nothing to say.
4. SUN workstation proposal - I reported the Dean was willing to pay
1/3 of the capital cost. Len presented an analysis suggesting it
would cost more for CSD-CF to buy the workstations because of
accounting issues. We then agreed on a motion to recommend
the dept. buy 10 using Stauffer money (see following message for
details and request for final vote on this.)
Adjournment for the IBM deception at 4:15 pm.
Corrections?
∂10-Nov-84 1134 cheriton@Pescadero SUN workstation motion - please vote
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 10 Nov 84 11:33:58 PST
Date: Sat, 10 Nov 84 11:32:30 pst
From: David Cheriton <cheriton@Pescadero>
Subject: SUN workstation motion - please vote
To: csdfacilities@Pescadero
I proposed the following at the last CSD facilities meeting (Nov.8th).
The members present were in favor. Can I hear from the others
(McCarthy and Binford) on this. I would dearly love to tell Gene that
we were unanimous on this (please).
We recommend to the dept. that it use the (revived) Stauffer fund
(of approximately $150K) to buy and maintain 10 Model 50 SUN workstations
(with 2 meg. memory each). The deal is as follows.
I expect the machines to cost about $10K each, for a total capital cost
of $100K.
The dean has offered to pay 1/3 for the workstations so the capital cost
to the dept. should be under $70K. The remaining question is maintenance.
Cost from SMI would be about $15K per year for the 10. The worst case
would be using some of the rest of the Stauffer fund (interest on
money would offset some of the maintenance cost). The best case would
be that the SUNs not cost anywhere near that to maintain and that we
can recover money from the Dean for maintenance - since these are supposed
to be part of our teaching facilities.
Of course, workstations are like terminals - it isnt lethal to have a few
dead at a time.
There seemed to be a general feeling that we could use much more than 10
workstations. However, it was deemed wise to get more experience with
their maintenance cost and posibilities for covering maintenance before
getting a larger number.
That's the proposal - what's your vote? (jmc, tob)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
This is a retransmission of the motivations, etc. in the original
proposal for handy reference.
I propose we conjure up the funds to buy 10-15 Model 50
("single-board") SUN workstations. These would probably cost
about $10K a piece, so we are talking about $100K - $150K
(and this is with fairly good discount from SMI - and no, they
are not willing to give us the machines.)
A model 50 SUN workstation is new product of SMI, being announced
in a few days. It is basically the size of a terminal, one or two
boards that fit right into the Monitor housing.
It provides 68010 plus 1-4 megabytes of memory (I'd like 2 meg.),
ethernet connection, framebuffer and graphics display plus mouse.
It boot over the Ethernet and expects to get all file access acros
the network as well.
Why Workstations?
1. They provide local editing, local computation facility in general,
multiple windows, etc. that make better use of the computers
we have on the networks (like less byte-at-a-time terminal traffic
overhead) plus allow students to make better use of the network.
2. They provide graphic displays. Our general facilities for graphics
(outside of research groups) has decreased over the last few years
with the death of several Altos.
3. They provide a better education for our students. E.g. ability to
do graphics, distributed computing, etc. for course and programming
projects.
In general, I think the general computing facilities in the dept. have
gone backwards in the 3 years I have been here from the perspective
that we have spent all our money upgrading fairly old systems (score
and sail) and almost nothing on newer approaches. It is only the
reseach projects that have bought Lisp and SUN workstations.
Why SUN workstations?
Basically three reasons:
1. They are what we really want in a workstation.
I.e. they have ethernet, memory mapping,
lots of memory, etc. What companies are willing to give us falls short
in one or more significant ways. E.g the HP workstations have no reasonable
display, network connection or memory managemnt hardware.
2. We have software that runs on them so could use them immediately in
our rather complex network environment. More over, SMI supplies
a Unix system for them whose use is also becoming increasingly common in
these parts.
3. They would provide compatibility with a number of research projects.
For example, my group, the Tex project, the robotics group, the NA
group and various groups in CSL and CIS use SUN workstations.
I even understand there has been some work to use SUNs as remote
terminals for Lisp machines (not sure the status on that though).
Thus, I would argue it is better for us to spent time getting money
to buy these than spend time trying to make do with what various
companies have offered to give us.
Note: SMI is not big enough to afford to give us the equipment.
Also, they cannot keep up with the demand from money-paying customers
right now, so the motivation to give away is low.
I would agree that it would be nice to get some Lisp machines as well.
However, their high cost and lower use of Lisp (I believe) in courses
makes it harder to justify at this time.
Finally finally, I think companies will eventually becoming out with
lots of workstations in the SUN workstation or better class, and we have
a good chance of being given some of those. I view this initial 10-15
as filing the void until we get some reasonable machines in our gift
offers. (For example, IBM and DEC both have some interesting machines
on the horizon.)
∂10-Nov-84 1849 YM
∂10-Nov-84 1831 JMC (on TTY161 1831)
What is date and time of your oral?
Monday 3-Dec-84 2pm MJH 146.
∂11-Nov-84 1427 CL.BOYER@UTEXAS-20.ARPA
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 11 Nov 84 14:27:08 PST
Date: Sun, 11 Nov 1984 16:23 CST
From: CL.BOYER@UTEXAS-20.ARPA
To: John McCarthy <JMC@SU-AI>
In-reply-to: Msg of 11 Nov 1984 15:17-CST from John McCarthy <JMC at SU-AI.ARPA>
My home phone is (512) 467-0182.
My UT office is (512) 471-1901.
On Monday and Tuesday I'll probably be at the Austin Burroughs
Research Center at (512) 258-2495.
You're welcome to call me at any number any time. I have been meaning
to call you, so I look forward to your call.
∂11-Nov-84 1915 RPG Multiprocessors
I just got back. Tomorrow I will send you a report on the potential
multiprocessors I saw: Synapse, Encore, Symbolics (!), and BBN.
-rpg-
∂12-Nov-84 1132 SMC TeX files
The TeX files are listed in projec.tex with status. Most of the files are
still in my area, because I want you to look at them to be sure they are
O.K. I will get you a hard copy of all completed files, proof-read by me
first. Carolyn has said that she wil be able to help me with my stickier
TeX problems after her orals.
∂12-Nov-84 1144 RA Meeting w/ Jeff Glaza
I haven't been able to reach him as of 11:45.
Sarah, this appointment is apparently for you, because it has to do
with a '71 International truck.
∂12-Nov-84 1145 SMC phone message
I found a message that Zella took for you. You are asked to call someone
(no name given) at 247-5405 to confirm an appointment fo 12:30 on Tuesday.
∂12-Nov-84 1333 CC.CLIVE@UTEXAS-20.ARPA Re: declination
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 12 Nov 84 13:33:27 PST
Date: Mon 12 Nov 84 15:34:17-CST
From: Clive Dawson <CC.Clive@UTEXAS-20.ARPA>
Subject: Re: declination
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 9 Nov 84 16:32:00-CST
A pity--we'll certainly miss you. But I certainly understand your position.
Cheers,
Clive
-------
∂12-Nov-84 1357 RA
Please call John Nafeh, MAD Computer (56) 943 1711.
∂12-Nov-84 1507 RA Tuesday, Nov. 13
I am going to be at my proposal administ. workshop tomorrow morning
and take the afternoon off. Is there anything urgent you need done.
∂12-Nov-84 1522 RPG Multiprocessors
To: JMC@SU-AI.ARPA, JJW@SU-AI.ARPA, cheriton@SU-PESCADERO.ARPA
CC: rpg-q@SU-AI.ARPA
The following companies are `in the running' as far as I'm concerned:
Denelcor
Synpase
Encore
Symbolics
BBN
Sequent
Let me discuss the pros and cons of each:
Denelcor:
We all looked at the HEP and have a pretty good idea of what it can do.
Pros:
1. Friendly and co-operative staff: they believe in what we're doing;
2. cute architecture; and
3. they are giving DARPA a `good deal.'
Cons:
1. The hardware implementation of the architecture make it very
difficult to do a cheap, fast Lisp, and
2. Lucid is less interested in doing it than some of the others,
because it is probably not a `typical' multiprocessor, such as
we might see in the next 10 years in common use.
Encore:
I talked at length to Gordon Bell, Ike Nasso, Steve Amarant, and Henry Weigart
from Encore in Massachusetts. I think that of the bunch-of-micros-on-a-bus
machines, Encore's has the highest potential in terms of being relatively high
performance and expandable in the near term to more processors than either of
Synpase or Sequent. This is because they have a 100 megabyte per second bus,
with separate address, data, interrupt, and parity paths.
There are 4 different board types in the machine: processor, memory, IO, and
Ethernet. I saw a physical example of each board on the workbench, with
logic analyzers hooked up to each. That is, they have gotten board back and
are now debugging them.
They use NS32032's, and appear to have them; they are running at 6 Mhz instead
of the nominal 10 mhz. The memories and bus support 32-bit addresses, and the
memories are 4-way interleaved
Each processor board has 2 cpu's and a shared cache between them. The
cache is 32kbytes. The memories support test-and-set. In the future each
board will have 4 processors, and National is going to a 2.5x faster chip
in a year or so. They have a software group that it porting Berkeley 4.2
to it. They have several functional emulators (made up of NS32016 boards)
on which they are doing software development.
They claim that the first 2-processor (1 cpu board) machine will be put together
this week, and having seen the state of the hardware as of last week, I think it
might be possible. In addition, they claim that they could get us a prototype
machine mext April-June.
In order to do a Lisp on that machine, Lucid would have to port our Sun Lisp to
the 32032. I think this could be done using a uni-processor between now and next
summer. With the uncertainties of the DARPA contract, the Encore time schedule
might not be a problem.
Pros:
1. 32032 is a nice machine;
2. fast bus makes for future expansion;
3. Bell has a strong interest in the project and has been
associated with multiprocessors for many years;
4. demand paging;
5. Unix; and
6. Lucid would want to do it.
Cons:
1. the Encore schedule could slip; and
2. Encore may collapse, though I don't see this right away.
Synapse:
I agree with everything that Cheriton said, except for one. That is, I
think that Synapse is a little closer to the brink than he thinks. Synapse
shipped machines too early a while back, and the investors have slapped their
wrists. They may be on a prove-yourself-or-die cycle.
I want to emphasize that Synapse will have *no* interest in helping us
at all unless we convince them that there is a market they could attack
with a parallel Lisp. Otherwise, I think, they will proceed in the database
area until their investors are happy.
Pros:
1. 68000 Lisp is a simple port of Lucid's Sun Lisp;
2. basically a good architecture;
3. they will accept a purchase order today;
4. reliable hardware;
5. nearby; and
6. Lucid would want to do it.
Cons:
1. They will not help us in any way unless we change their
marketting strategy to include AI;
2. operating system is not something Lucid wants to do; and
3. perhaps they're not long for this world also.
BBN:
BBN appears to be about to get strategic computing money to put a Common Lisp
on the Butterfly along with a multiprocessing version of it. Poor lads, they
thought I (rpg) was going to do the Common Lisp for them for free. I talked to
a panic-stricken Don Allen last week, and he strongly suggests we use the
Butterfly. He and Randy Rettberg, a manager, are willing to fly out to Stanford
for a show-and-tell. They hope that we select the Butterfly and get DARPA to pay
for Lucid to put Common Lisp and the low-level primitives for Qlambda on the
Butterfly. They would then take the Lisp and the primitives and do something
different from Qlambda for DARPA.
It sounds like there are a few things wrong with their suggestion: 1), they are
suggesting that DARPA pay twice for some of the work, namely the multiprocessing
primitives, and 2), I think DARPA is more nearly sold on Qlambda than it would
be on a parallel Lisp to be specified later.
Nevertheless, the Butterfly is a 68000-based machine and it exists.
Pros:
1. 68000-based machine;
2. Sun Lisp easy to port;
3. butterfly switch is not so bad;
4. machine exists;
5. BBN *wants* to co-operate; and
6. Lucid is not against doing this.
Cons:
1. Unknown operating system; and
2. the switching network may need to be micro-coded to
handle a synchronization primitive.
Let me elaborate on this last point. Each cpu board has a micro-codable
memory-watcher. This memory-watcher implements the butterfly network, and there
is more control store in which to do other things. For example, references to
certain memory locations can be interpreted as other sorts of instructions
by this watcher. I'm not sure how much programming of it must be done.
Symbolics:
I talked to them about multi-processors, and I was surprised when they said that
they had proposed a multi-processor to Arvind, which would be a memory-bus or
multi-ported memory scheme. Another possibility would be a gigabyte serial
port amongst some 3600's. Symbolics volunteered to send out someone to Stanford
to chat about it.
Pros:
1. The 3600 already has a Lisp.
Cons:
1. I'm not at all sure whether they could deliver this in a
reasonable length of time.
Sequent:
They are left to look at. They have delivered, and use 32032's. Gordon Bell
says that except for a slower bus, they are similar to the Encore machine.
Tomorrow I am starting my sequence of inquiries which ought to land us some
information soon.
-rpg-
∂12-Nov-84 1544 cheriton@Pescadero Re: proposal to spend Stauffer money on SUNs
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 12 Nov 84 15:44:02 PST
Date: Mon, 12 Nov 84 02:51:20 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Re: proposal to spend Stauffer money on SUNs
To: JMC@Sail, csdfacilities@SU-PESCADERO.ARPA
I am concerned about getting into a discussion about what is the most
cost-effective way to spend the Stauffer funds given the small probability
that anyone's opinion will change on the subject. I note that 3 years
ago, you were not enthused about workstations and proposed developing
the McSuns. At that same time, I was enthused about workstations
and still am. We now use the SUNs for local editting, running illustrators,
compilers, metafont, and other experimental programs as well as terminals
to other machines. My primary motivation for this proposal to buy SUN
workstations is to improve the dept. computing facilities along the lines
that I have used successfully in my research project. I dont
claim to know that it is optimal, and certainly not the only way, but
the SUNs are something we can order now, with software, and something I am
willing to ensure become usable, and I know work from previous experience.
The first discussion I was involved in comparing workstations to
McSun-like systems was in the context of the DARPA facilities money.
The solution to this difference of opinion (and others) was to divide the
money about groups and let them spend as they chose. Perhaps this is the
only sensible solution here as well. I.e. divide the dept. money
available among the competing proposals in some reasonable way.
The other solution (I suppose) is to wait until McSuns are real and
functioning at a level comparable for SUN workstations, at least as
multi-window terminals. Personally, I would prefer to do something
sooner.
∂12-Nov-84 1545 JDLH@SU-SCORE.ARPA Re: SUN workstation motion - please vote
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 12 Nov 84 15:45:32 PST
Received: from SU-SCORE.ARPA by Pescadero with TCP; Sun, 11 Nov 84 11:51:01 pst
Date: Sun 11 Nov 84 11:50:52-PST
From: Jim DeLaHunt <JDLH@SU-SCORE.ARPA>
Subject: Re: SUN workstation motion - please vote
To: csdfacilities@SU-PESCADERO.ARPA
Cc: JDLH@SU-SCORE.ARPA
In-Reply-To: Message from "David Cheriton <cheriton@Pescadero>" of Sat 10 Nov 84 11:33:01-PST
I have no corrections to the minutes.
I can't compare MacSuns to Datadisks to Explorers to Suns, since I don't
know what any of them are. All I know is that I, a first-year MS, don't
currently have access to any workstation environment and do not presently
see how I will get access to same. I think that's a pity--workstations are
out there, and we MSers should get at least some exposure to them. This
is a curriculum weakness, but also a facilities weakness.
I vote in favour of David's proposal (pending consultation with my fellow
students who know more about what things are like now).
--Jim DeLaHunt JDLH @ Score (415) 327-JDLH
-------
∂12-Nov-84 1547 JJW@SU-AI.ARPA Workstations
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 12 Nov 84 15:46:58 PST
Received: from SU-AI.ARPA by Pescadero with TCP; Sat, 10 Nov 84 13:09:32 pst
Date: 10 Nov 84 1309 PST
From: Joe Weening <JJW@SU-AI.ARPA>
Subject: Workstations
To: csdfacilities@SU-PESCADERO.ARPA
Yesterday I heard that TI is offering Stanford the same sort of discount
on Explorer Lisp machines as it is giving MIT and some other universities.
This is the first time I had realized that we have the opportunity to buy
these at approximately $15K each.
I think we should consider these as well as the Suns. Some reasons for
wanting them are:
> They are a more cost-efficient Lisp workstation than the Symbolics 3600
(certainly at this discount)
> Students here should be exposed to the Lisp environment as well as the
Sun workstation environment
> It might help attract students from the other places that are getting
these, when they are considering Stanford as a graduate school.
Tom Rindfleisch probably knows more of the details about these than any
of us.
Joe
∂12-Nov-84 1546 JMC@SU-AI.ARPA proposal to spend Stauffer money on SUNs
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 12 Nov 84 15:46:35 PST
Received: from SU-AI.ARPA by Pescadero with TCP; Sat, 10 Nov 84 13:50:26 pst
Date: 10 Nov 84 1250 PST
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: proposal to spend Stauffer money on SUNs
To: csdfacilities@SU-PESCADERO.ARPA
Unfortunately, I can't vote for the SUN proposal without more discussion.
In my present opinion McSun is a far more cost-effective use of the
Stauffer money. The McSuns are not a replacement for Datadisk which
isn't broken. Instead they provide a cost-effective way, $1200 per
channel instead of $10K apiece, to access all the Department's computers,
because they will be on the Ethernet.
The Suns we have are still being used by many people as terminals to
VAXen.
∂12-Nov-84 2114 JMC@SU-AI.ARPA McSun vs. workstation
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 12 Nov 84 21:14:22 PST
Received: from SU-AI.ARPA by Pescadero with TCP; Mon, 12 Nov 84 21:13:46 pst
Date: 12 Nov 84 2113 PST
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: McSun vs. workstation
To: csdfacilities@SU-PESCADERO.ARPA
I am inclined to agree that our positions are unlikely to change, since
they compare a larger number of McSuns to a smaller number of more
powerful workstations. Therefore, I propose that we split the money,
spend the workstation share now, and reserve the other half for some
reasonable length of time for McSuns. If the McSun gets unreasonably
delayed, then we should compare getting more workstations with
distributing ordinary terminals to grad student desks. While I
like Lisp machines, I can't really compare them with Suns for
the kind of thing most people do here. To what extent is the
connection of the original Sun development with Stanford
important, e.g. are many students feeling deprived of getting
the benefit of work they have done in the past.
∂12-Nov-84 2209 RPG
∂12-Nov-84 2138 JMC Kahn
Sometime soon I would like to forward a comparison of machines looked
at to Bob Kahn. The idea is to let him know that we are being reasonably
diligent and to ask him if there are additional considerations from his
point of view that should influence the decision. I'm rather inclined
to forward your comparison together with some remarks of my own after
you have probed the one additional company.
Ok, feel free. Perhaps you should make a pass over it for typos and the
like?
∂12-Nov-84 2227 cheriton@Pescadero Re: Multiprocessors
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 12 Nov 84 22:27:30 PST
Date: Mon, 12 Nov 84 22:27:00 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Re: Multiprocessors
To: JJW@Sail, JMC@Sail, RPG@Sail, cheriton@SU-PESCADERO.ARPA
Cc: rpg-q@Sail
Boy, this must be a dangerous business. Of the two companies that
would accept a purchase order tomorrow, have delivered machines,
and could give us a delivery date, both seem to have some good chance
of failing!
Seems to me a need to get a better handle on time frames here.
If you are willing to wait a year, then lots of things are possible.
If you need the machine sooner, that limits the choices.
Perhps the right strategy is to decide on a type of machine, come up
with a plausible "placeholder" machine, and pull a switch if necessary
and possible when the DARPA funding is real.
In that vein of reasoning, the choices seem to be basically between
a HEP and a "bunch-of-micros-on-a-bus". The latter has several
more or less interchangeable possibilities. The Synapse machine might
be a good placeholder because it is real, expensive and a plausible
choice. I also rather favor MMPM (multi-microprocessor machine) over
a HEP, although the HEP would be fun to play with, even if not to write
Lisp code for.
∂12-Nov-84 2314 cheriton@Pescadero Re: McSun vs. workstation
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 12 Nov 84 23:14:15 PST
Date: Mon, 12 Nov 84 23:13:48 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Re: McSun vs. workstation
To: JMC@Sail, csdfacilities@SU-PESCADERO.ARPA
OK, how about the following proposition:
We recommend to the dept. that it spend the Stauffer money on
improving student access to computing, with half going to SUN
workstations and half going to McSuns. The half for each would
cover initial cost plus maintenance for 3 years (at least).
Figuring on $75K as half, I will talk to SMI to see if we can
buy SUNs with a 3 year board-swap warranty, and if so, how many.
If possible, we might be able to bleed the dean more if we can
bury the maintenance cost for a while as capital cost.
Let me try to get this info.
Any objections to this plan?
The original SUN connection to Stanford is important in that
they are better integrated into our environment than other
random equipment is/can be, and, more students want to use
them than have access to them - in part - because of the
interesting software developed here at Stanford for them.
There arent any "grandfathers" of SUNs that dont have access
to one - to my knowledge.
∂12-Nov-84 2338 JMC@SU-AI.ARPA
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 12 Nov 84 23:37:55 PST
Received: from SU-AI.ARPA by Pescadero with TCP; Mon, 12 Nov 84 23:37:19 pst
Date: 12 Nov 84 2337 PST
From: John McCarthy <JMC@SU-AI.ARPA>
To: csdfacilities@SU-PESCADERO.ARPA
I agree with Cheriton proposal 1984 Nov. 12 23:14.
∂13-Nov-84 1539 NILSSON@SRI-AI.ARPA
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 13 Nov 84 15:39:50 PST
Date: Tue 13 Nov 84 15:40:06-PST
From: NILSSON@SRI-AI.ARPA
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 8 Nov 84 11:57:00-PST
About prevention: I don't know about very much work on that problem.
Near the end of the "Shakey" project I was interested in extending
the STRIPS idea to problems in which there were other agents (other
than the one STRIPS was doing the planning for) doing things. Their
actions (like under what circumstances they would do what) obviously
had to be modeled in some way so that the planning agent could take
them into account in doing its own planning. One of the things the
planning agent might want to try to do would be to arrange that
the triggering condition for some other agent doing something would be
defeated--thus "preventing" the other agent from doing what he might
otherwise have done. That line of thought got interrupted somehow, and
it wasn't very formal anyway.
Drew McDermott has also thought about this problem in what he calls
"The Little Nell" problem. (The robot tries to prevent little Nell--who
is tied to the railroad tracks--from getting run over. But once it
finds a plan and knows that it is going to execute it, the robot
ceases to believe that little Nell will get run over and therefore
doesn't do anything. Drew was worried about the paradox involved in this,
but I haven't taken the trouble yet to find out if there really is
a paradox there.) I'm not sure what the reference is--you might send
a net msg to Drew. In terms of Drew's "chronicles," the planning system
needs to make sure that undesireable chronicles aren't traversed by
making the right decisions at the chronicle branch points where the
planner gets to decide.
I think maybe James Allen in his axiomatization of time and processes
may have something to say about prevention--he has articles in the
last few AAAI and IJCAI volumes.
I'm going to start looking into all of this in more detail when I get
to that point in my book writing.
I'd like to keep track of how you do on all of this. -Nils
-------
∂13-Nov-84 1634 JDLH@SU-SCORE.ARPA What are McSuns?
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Nov 84 16:34:27 PST
Date: Tue 13 Nov 84 08:13:24-PST
From: Jim DeLaHunt <JDLH@SU-SCORE.ARPA>
Subject: What are McSuns?
To: jmc@SU-AI.ARPA
cc: JDLH@SU-SCORE.ARPA
I'm new here, and the brief discussions of McSuns didn't leave me very clear
on just what they are and how they differ from the Sun. Who should I talk
to to sort this out? You? Len? Someone else? And when are their office
hours?
--Jim DeLaHunt JDLH @ Score (415) 327-JDLH
-------
∂13-Nov-84 1953 YM PhD Orals time
To: GIO@SU-AI.ARPA, JMC@SU-AI.ARPA, RJW@SU-AI.ARPA, ZM@SU-AI.ARPA
CC: cheadle@SU-SCORE.ARPA
The Graduate Program people prefer to have the orals at 2:15 rather than 2pm.
So update your calendars: 2:15pm Monday 3 December 84. If this causes any
problem let me (and Victoria) know ASAP.
Thanks,
Yoni Malachi.
∂13-Nov-84 2239 PITNER@SU-SIERRA.ARPA re: Flame: What the Democratic Party did wrong (from SAIL's BBOARD)
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 13 Nov 84 22:39:04 PST
Date: Tue 13 Nov 84 22:32:30-PST
From: Philip M. Pitner <PITNER@SU-SIERRA.ARPA>
Subject: re: Flame: What the Democratic Party did wrong (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 9 Nov 84 19:24:00-PST
John,
I agree completely...Bravo!
Phil
-------
∂14-Nov-84 0117 JDLH@SU-SCORE.ARPA re: What are McSuns?
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Nov 84 01:17:05 PST
Date: Wed 14 Nov 84 01:16:39-PST
From: Jim DeLaHunt <JDLH@SU-SCORE.ARPA>
Subject: re: What are McSuns?
To: JMC@SU-AI.ARPA
cc: JDLH@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 13 Nov 84 18:07:00-PST
Thank you for the information. I take it Len is the best person to talk to
for further, more detailed info.
--Jim DeLaHunt JDLH @ Score (415) 327-JDLH
-------
∂14-Nov-84 0212 @SU-SCORE.ARPA:KIPARSKY@SU-CSLI.ARPA Princiapls Meeting
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Nov 84 02:12:31 PST
Received: from SU-CSLI.ARPA by SU-SCORE.ARPA with TCP; Wed 14 Nov 84 02:12:04-PST
Date: Tue, 13 Nov 1984 19:50 PST
Message-ID: <KIPARSKY.12063384461.BABYL@SU-CSLI.ARPA>
From: KIPARSKY@SU-CSLI.ARPA
To: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Cc: Ingrid@SU-CSLI.ARPA, Israel@SU-CSLI.ARPA, Principals@SU-CSLI.ARPA
Subject: Princiapls Meeting
In-reply-to: Msg of 13 Nov 1984 11:03-PST from Jon Barwise <BARWISE>
I will be out of town Nov. 27.
Paul
∂14-Nov-84 0238 @SU-SCORE.ARPA:BARWISE@SU-CSLI.ARPA AI job
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Nov 84 02:38:28 PST
Received: from SU-CSLI.ARPA by SU-SCORE.ARPA with TCP; Wed 14 Nov 84 02:38:02-PST
Date: Sun 11 Nov 84 14:59:06-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: AI job
To: research@SU-CSLI.ARPA
Friends in the C.S. department at the University of Wisconsin have
asked me steer them onto some good people that might want a job in
Madison. They asked in particular about people in A.I. I gather this
is a tenure track assistant professorship. Anyone here interested in
being mentioned to them?
-------
∂14-Nov-84 0421 @SU-SCORE.ARPA:BARWISE@SU-CSLI.ARPA Princiapls Meeting
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Nov 84 04:20:51 PST
Received: from SU-CSLI.ARPA by SU-SCORE.ARPA with TCP; Wed 14 Nov 84 04:20:24-PST
Date: Tue 13 Nov 84 11:03:01-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Princiapls Meeting
To: Principals@SU-CSLI.ARPA, Israel@SU-CSLI.ARPA
cc: Ingrid@SU-CSLI.ARPA
I would like to call a principals meeting for the Tuesday after
Thanksgiving, Nov 27. Please inform Ingrid of your preference as to
time. It will last at most one hour.
1) 8 a.m.
2) 12:00
3) 3:30
4) 5
There are certain decisions that must be made now that will effect the
long term nature of CSLI, decisions that will effect all of us. These
will be the subject of the meeting.
Jon
-------
∂14-Nov-84 1054 PETTY@RUTGERS.ARPA Nov. '84 tech-rep mailing
Received: from RUTGERS.ARPA by SU-AI.ARPA with TCP; 14 Nov 84 10:54:03 PST
Date: 14 Nov 84 13:49:52 EST
From: PETTY@RUTGERS.ARPA
Subject: Nov. '84 tech-rep mailing
To: Erman@SRI-KL.ARPA, SHORTLIFFE@SUMEX-AIM.ARPA, DREIFUS@WHARTON-10.ARPA,
bennett@SU-SCORE.ARPA, MITTAL@PARC-MAXC.ARPA, CHANDRASEKARAN@RUTGERS.ARPA,
JSMITH@RUTGERS.ARPA, WILKINS@SRI-KL.ARPA, BRUCE@BBNA.ARPA,
FRIEDLAND@SUMEX-AIM.ARPA, PLONDON@USC-ISIB.ARPA, RDG@SU-AI.ARPA,
PRESSBURGER@KESTREL.ARPA, CSD.GARDNER@SU-SCORE.ARPA, FAGAN@SUMEX-AIM.ARPA,
FIKES@XEROX.ARPA, JMC@SU-AI.ARPA, CLANCEY@SUMEX-AIM.ARPA, KRD@MIT-AI.ARPA,
HAMILTON.ES@PARC-MAXC.ARPA, AMSLER@SRI-AI.ARPA,
ChiNguyen.ES@PARC-MAXC.ARPA, kwh@MIT-AI.ARPA, UTGOFF@RUTGERS.ARPA,
TUROCK@RUTGERS.ARPA, ECG.RICH@DEC-MARLBORO.ARPA
cc: petty@RUTGERS.ARPA, loungo@RUTGERS.ARPA
PUBLICATION ORDER FORM
LABORATORY FOR COMPUTER SCIENCE RESEARCH
New Brunswick, New Jersey 08903
Novbember, 1984
The Laboratory for Computer Science Research at Rutgers University, New
Brunswick, is pleased to announce the availability of new Technical Reports.
An abstract of each is attached.
Use this form to order the announced publications. To order, please check the
box next to the title of the publication(s) that you are interested in. Then
detach this sheet, refold so that our address is facing out, attach a
first-class stamp, and mail.
[ ] CBM-TR-141 "REPRESENTATION AND PROBLEM SOLVING: THEORETICAL
FOUNDATIONS", Allen Ginsberg.
[ ] CBM-TR-143 "A KNOWLEDGE REPRESENTATION FRAMEWORK FOR EXPERT CONTROL OF
INTERACTIVE SOFTWARE SYSTEMS", C.V. Apte and S. Weiss.
[ ] CBM-TR-144 (THESIS) (If you wish to order this thesis, a pre-payment
of $15.00 is required. "A FRAMEWORK FOR EXPERT CONTROL OF
INTERACTIVE SOFTWARE SYSTEMS", C.V. Apte.
[ ] DCS-TR-139 "EXPLORING THE STRUCTURE OF INCREMENTAL ALGORITHMS",
A. Berman, M. Paull and C.C. Cheng.
[ ] DCS-TR-147 "AN ALGORITHM FOR LARGE-SCALE GLOBAL MINIMIZATION OF
LINEARLY CONSTRAINED CONCAVE QUADRATIC FUNCTIONS",
B. Kalantari and J.B. Rosen.
[ ] DCS-TR-148 "PENALTY FORMULATION FOR ZERO-ONE PROGRAMMING",
B. Kalantari and J.B. Rosen.
[ ] LCSR-TR- 55 "THE CRITTER SYSTEM: AUTOMATED CRITIQUING OF DIGITAL
CIRCUIT DESIGNS", Van E. Kelly.
[ ] LCSR-TR-57 "VEXED: A KNOWLEDGE-BASED VLSI DESIGN CONSULTANT", T.M.
Mitchell, L.I. Steinberg and J.S. Shulman.
[ ] LCSR-TR-58 "THE RECTANGLE PLACEMENT LANGUAGE", J.A. Roach.
[ ] LCSR-TR-59 "A LOWER BOUND TO THE COMPLEXITY OF EUCLIDEAN MATCHING
ALGORITHMS", D. Grigoriadis and B. Kalantari.
[ ] LRP-TR 17 "ANALOGY WITH PURPOSE IN LEGAL REASONING FROM PRECEDENTS",
S. Kedar-Cabelli.
-------
∂14-Nov-84 1119 BSCOTT@SU-SCORE.ARPA Couple of things
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Nov 84 11:19:07 PST
Date: Wed 14 Nov 84 11:18:17-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Couple of things
To: JMC@SU-AI.ARPA
cc: RA@SU-AI.ARPA, BScott@SU-SCORE.ARPA
1. The NSF grant has not been received by Stanford. Did Chien give you
the recommended start date?
2. Dick Gabriel told Rutie that he is to have a consulting professor appoint-
ment after he leaves. Is this something we should be doing now?
Betty
-------
∂14-Nov-84 1152 FISHER@SU-SCORE.ARPA Meeting 11/20/84
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Nov 84 11:52:00 PST
Date: Wed 14 Nov 84 11:51:21-PST
From: Norine Fisher <FISHER@SU-SCORE.ARPA>
Subject: Meeting 11/20/84
To: Nilsson@SU-SCORE.ARPA, Knuth@SU-SCORE.ARPA, Ullman@SU-SCORE.ARPA,
McCarthy@SU-SCORE.ARPA
cc: Golub@SU-SCORE.ARPA
a meeting discussing slots and appointments is scheduled for 11/20/84 at
10:00 a.m. Attendees invited include: G. Bower, G. Golub, N. Nilsson,
D. Knuth, J. Ullmann, J. McCarthy. Please let me know if this time is
inconvenient and what time might be better. Thanks. Norine
-------
∂14-Nov-84 1328 mogul@Navajo
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 14 Nov 84 13:28:11 PST
From: Jeff Mogul <mogul@Navajo>
Date: 13 Nov 1984 1156-PST (Tuesday)
To: John McCarthy <JMC@SU-AI.ARPA>
Cc: csdfacilities@SU-PESCADERO.ARPA
In-Reply-To: John McCarthy <JMC@SU-AI.ARPA> / 12 Nov 84 2337 PST.
I, too, agree with the Nov. 12 23:14 proposal. However, I would like
to see how that $75K breaks down into machines vs. maintenance before
we go ahead ...
∂14-Nov-84 1358 RA Reason
Reason agreed to the change to "first serial rights", I changed it and
mailed it.
∂14-Nov-84 1445 mogul@Navajo
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 14 Nov 84 14:44:19 PST
Received: from Navajo.ARPA by Pescadero with TCP; Tue, 13 Nov 84 11:56:56 pst
From: Jeff Mogul <mogul@Navajo>
Date: 13 Nov 1984 1156-PST (Tuesday)
To: John McCarthy <JMC@SU-AI.ARPA>
Cc: csdfacilities@SU-PESCADERO.ARPA
In-Reply-To: John McCarthy <JMC@SU-AI.ARPA> / 12 Nov 84 2337 PST.
I, too, agree with the Nov. 12 23:14 proposal. However, I would like
to see how that $75K breaks down into machines vs. maintenance before
we go ahead ...
∂14-Nov-84 1445 pratt@Navajo Re: Prof. Pratt's new conjecture
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 14 Nov 84 14:44:25 PST
From: Vaughan Pratt <pratt@Navajo>
Date: 12 Nov 1984 1320-PST (Monday)
To: Shang-Ching Chou <ATP.CHOU@UTEXAS-20.ARPA>
Cc: Cl.Boyer@UTEXAS-20.ARPA, Cl.Moore@UTEXAS-20.ARPA,
Atp.Schelter@UTEXAS-20.ARPA, jmc@SU-AI, pratt@Navajo
Subject: Re: Prof. Pratt's new conjecture
In-Reply-To: Shang-Ching Chou <ATP.CHOU@UTEXAS-20.ARPA> /
Mon 12 Nov 84 09:45:45-CST.
Hey, that's terrific! What's special about the special case? An easy way to
get more evidence for the general case for quadrilaterals is just to measure
two or three quadrilaterals chosen at random to see if they are
counterexamples. I still haven't gotten around to doing this.
Sounds like GC is a big event when it strikes. Maybe at the start of each GC
the system should print out "Sleeping on the problem for a bit." Should
appeal to those who think sleeping is for garbage collection.
I haven't heard from Athos Kasapi since I sent him the problem two months ago.
He transferred to Stanford from Waterloo at about that time, now I need to
locate him.
Apparently Prof. Wu is visiting Stanford around Nov. 19 to talk with John
McCarthy. I am looking forward to meeting him. He should find these
developments interesting.
-v
∂14-Nov-84 1453 FISHER@SU-SCORE.ARPA re: Meeting 11/20/84
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Nov 84 14:53:44 PST
Date: Wed 14 Nov 84 14:33:38-PST
From: Norine Fisher <FISHER@SU-SCORE.ARPA>
Subject: re: Meeting 11/20/84
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 14 Nov 84 14:32:00-PST
thanks. Norine
-------
∂14-Nov-84 1500 @SU-SCORE.ARPA:NILSSON@SRI-AI.ARPA Re: Meeting 11/20/84
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Nov 84 15:00:03 PST
Received: from SRI-AI.ARPA by SU-SCORE.ARPA with TCP; Wed 14 Nov 84 14:36:50-PST
Date: Wed 14 Nov 84 14:37:23-PST
From: NILSSON@SRI-AI.ARPA
Subject: Re: Meeting 11/20/84
To: FISHER@SU-SCORE.ARPA
cc: Knuth@SU-SCORE.ARPA, Ullman@SU-SCORE.ARPA, McCarthy@SU-SCORE.ARPA,
Golub@SU-SCORE.ARPA, NILSSON@SRI-AI.ARPA
In-Reply-To: Message from "Norine Fisher <FISHER@SU-SCORE.ARPA>" of Wed 14 Nov 84 12:12:57-PST
Could the meeting start a little earlier than 10 am? I have to leave
for another appointment at 10:40. (Meeting to discuss new appointments, etc
in CSD.) -Nils
-------
∂14-Nov-84 1618 RINDFLEISCH@SUMEX-AIM.ARPA IP/TCP Update for Symbolics 3600's
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 14 Nov 84 16:18:48 PST
Date: Wed 14 Nov 84 16:17:46-PST
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: IP/TCP Update for Symbolics 3600's
To: JMC@SU-AI.ARPA, TOB@SU-AI.ARPA, JAM@SU-SCORE.ARPA
cc: Rindfleisch@SUMEX-AIM.ARPA, Banks@SUMEX-AIM.ARPA,
Genesereth@SUMEX-AIM.ARPA, Yan@SUMEX-AIM.ARPA, Pattermann@SUMEX-AIM.ARPA
Symbolics has now announced their commercial version of IP/TCP -- we've been
running with the beta test version for months now. The official release will
be required for release 5.2 and later of the ZetaLisp system. Now the cost.
$3,000 per machine or $15,000 for the Stanford site plus $150 per machine. My
recollection is the following machine distribution: HPP - 4, JMC - 2, TOB - 1,
and JAM - 1. For these 8 machines the cost per machine with the site license
would be $2,025 as opposed to the $3,000 Symbolics per machine charge. So, I
propose that we pool together to buy the site license. If agreeable, I need
charge numbers from each of you to cover your share of the cost. Please
respond asap as release 5.2 is now out.
Tom R.
-------
∂14-Nov-84 2102 WEGENER@SU-SCORE.ARPA Atari's additive synthesis VLSI chip for music/speech - sponsor sought
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Nov 84 21:02:13 PST
Date: Wed 14 Nov 84 20:59:31-PST
From: Albert Wegener <WEGENER@SU-SCORE.ARPA>
Subject: Atari's additive synthesis VLSI chip for music/speech - sponsor sought
To: faculty@SU-SCORE.ARPA
I am an honors co-op student in the computer engineering program,
and I work for Atari Corp. (the new Atari bought in July by Jack Tramiel,
the founder of Commodore). As a winter quarter EE 391 / CS 293 project, I
am looking for a professor to sponsor me in writing a publication-ready
paper about our additive synthesis, custom VLSI, music/speech chip and
its associated software. I have been involved with the project since its
inception in 1983, and products using the chip will be commercially available
in early 1985. If you are interested in sponsoring such a paper, or would
like more information, please contact me by November 23. Thank you for
your consideration.
Al Wegener 408-745-4905 (W)
Atari Corp. 415-969-0105 (H)
1196 Borregas Ave. wegener@score
Sunnyvale, CA 94086 w.wegener@lotsb
-------
∂15-Nov-84 0311 @SU-SCORE.ARPA,@SU-CSLI.ARPA:Kay.pa@Xerox.ARPA Re: Princiapls Meeting
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Nov 84 03:10:52 PST
Received: from SU-CSLI.ARPA by SU-SCORE.ARPA with TCP; Thu 15 Nov 84 03:09:43-PST
Received: from Xerox.ARPA by SU-CSLI.ARPA with TCP; Wed 14 Nov 84 10:40:54-PST
Received: from Chardonnay.ms by ArpaGateway.ms ; 14 NOV 84 10:26:48 PST
Date: 14 Nov 84 10:26 PST
From: Kay.pa@XEROX.ARPA
Subject: Re: Princiapls Meeting
In-reply-to: Jon Barwise <BARWISE@SU-CSLI.ARPA>'s message of Tue, 13 Nov
84 11:03:01 PST
To: BARWISE@SU-CSLI.ARPA
cc: Principals@SU-CSLI.ARPA, Israel@SU-CSLI.ARPA, Ingrid@SU-CSLI.ARPA
My time perferences for the meeting on Nov 27 are (1) 8 a.m, (2) 5, (3)
12:00, (4) 3:30.
--Martin
∂15-Nov-84 0356 @SU-SCORE.ARPA:JODY@SU-CSLI.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Nov 84 03:56:19 PST
Received: from SU-CSLI.ARPA by SU-SCORE.ARPA with TCP; Thu 15 Nov 84 03:54:33-PST
Date: Wed 14 Nov 84 17:01:46-PST
From: Joe Zingheim <JODY@SU-CSLI.ARPA>
To: JMC@SU-CSLI.ARPA
Did you really say such unkind things about me to Ostrom?
-------
∂15-Nov-84 0432 @SU-SCORE.ARPA,@SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Nov 84 04:32:26 PST
Received: from SU-CSLI.ARPA by SU-SCORE.ARPA with TCP; Thu 15 Nov 84 04:17:14-PST
Received: from SU-AI.ARPA ([36.36.0.194].#Internet) by SU-CSLI.ARPA with TCP; Wed 14 Nov 84 18:35:34-PST
Date: 14 Nov 84 1828 PST
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
To: "@DIS.DIS[1,CLT]"@SU-AI.ARPA
Speaker: Professor Christian Mez, visiting U.C. Berkeley
Title: HNN-Extensions of algebras and applications
Place: Room 381-T, 1st floor Math. Corner, Stanford University
Time: Monday November 19, 4:15-5:30 p.m.
Abstract: HNN(Higman-Nuemann-Neumann) theorems have to do
with embeddings of recursively presented algebraic structures
in finitely presented structures of the same type, and
consequences for solvability (or unsolvability) of the word
problem for such structures.
There will be a no-host dinner at some local restuarant after
the talk.
S. Feferman
∂15-Nov-84 0843 RINDFLEISCH@SUMEX-AIM.ARPA re: IP/TCP Update for Symbolics 3600's
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 15 Nov 84 08:43:02 PST
Date: Thu 15 Nov 84 08:43:39-PST
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: re: IP/TCP Update for Symbolics 3600's
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 14 Nov 84 18:31:00-PST
Thanks, John. Tom R.
-------
∂15-Nov-84 0944 RA Bill Hogan
I wanted to remind you that you have a 10:30 meeting with Bill Hogan from
Honeywell.
∂15-Nov-84 0934 RPG Russian Words
What do the following mean?:
notniye (spelled ``HOTH61E'')
fondahk (spelled ``FOHDAX'')
They are part of the title on a catalog of piano pieces, perhaps a catalog
of recordings.
-rpg-
notniye is an adjective referring to musical notes.
My Russian English dictionary gives examples
notniye pismo meaning musical notation
notniye bumaga - music paper
notnaya linyeka - musical line.
fondakh is the locative plural of the noun fond meaning fund or supply.
Therefore the word might mean "at the supply". It would help to have more
context.
∂15-Nov-84 1033 BARWISE@SU-CSLI.ARPA Anniversary
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 15 Nov 84 10:33:10 PST
Date: Thu 15 Nov 84 10:30:53-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Anniversary
To: research@SU-CSLI.ARPA
Barbara and I have just realized that this past Tuesday and Wednesday
were the two-year anniversary of the first meeting at SDF. Barbara
and Bill Woods put together a panel to make a presentation to SDf
about progress in the study of language that made it timely for SDF to
invest in language. The presentation was in December of 83, but we
met in NOvember of 83 to discuss what we would say. We have come a
long way since then. Let's have a drink (of tea?) to the vision that
Barbara, Bill, Brian, and Charlie Smith had, even if they were all
different visions, and even if none of them are exactly what we have
created here. They were the visions that made CSLI become a reality.
Jon
-------
∂15-Nov-84 1503 RPG
∂15-Nov-84 1222 JMC
∂15-Nov-84 0934 RPG Russian Words
What do the following mean?:
notniye (spelled ``HOTH61E'')
fondahk (spelled ``FOHDAX'')
They are part of the title on a catalog of piano pieces, perhaps a catalog
of recordings.
-rpg-
notniye is an adjective referring to musical notes.
My Russian English dictionary gives examples
notniye pismo meaning musical notation
notniye bumaga - music paper
notnaya linyeka - musical line.
fondakh is the locative plural of the noun fond meaning fund or supply.
Therefore the word might mean "at the supply". It would help to have more
context.
Well, I saw the book earlier today and thought of sending you the words I could
remember only later. I just called Lynne - it is a book the music library just
got - and got her to read the title to me. She started,
``H-O-T-H-sixtyone-E backwards N-...''
I think the title is:
notniye izdaniya b fondak governmental library USSR imeni (in the name of)
V.I. Lenin katalog
Later it says:
pianoforte oochebno-pedagogicheski repertooar.
This last bit is difficult to read, and especially over the noisy
channel of the phone and Lynne's description of the letters.
∂15-Nov-84 1513 LIBRARY@SU-SCORE.ARPA New Books in the Math/CS Library
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Nov 84 15:13:40 PST
Date: Thu 15 Nov 84 15:00:01-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: New Books in the Math/CS Library
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
Super-Computers and Parallel Computation by Paddon QA76.5.S895 1984
Conference on Applied Natural Language Processing Proceedings 1983
P98.C66 1983
1982 Rochester Forth Conference on Data Bases and Process Control QA76.73.F24R6
Recursion via Pascal by Rohl QA76.73.P2R634 1984
Productive Software Test Management QA76.6.E9784 1984
Building Controls into Structured Systems by Brill QA76.9.S88B75 1983
IEEE 1984 International Symposium on Medical Images and Icons IEEE Computer
Society R857.O6I33 1984
Artificial Intelligence in Basic by James Q336.J36 1984
Harry Llull
-------
∂15-Nov-84 1514 BSCOTT@SU-SCORE.ARPA Your Salary
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Nov 84 15:14:35 PST
Date: Thu 15 Nov 84 15:02:51-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Your Salary
To: JMC@SU-AI.ARPA
cc: BScott@SU-AI.ARPA
John, I have just learned that your salary has not been paid to you for
September and October (the 84-85 salary). This surfaced because Personnel
called about your benefits.
I do not know what happened, but I do know that we processed all the necessary
paperwork. We have a copy of it in our file. Anyway, we have delivered a
copy of your papers to payroll. We will have a check (not a deposit receipt)
by noon tomorrow.
I am terribly sorry about this, but nobody seems to know what happened.
Betty
-------
∂15-Nov-84 1538 RA
Allen Brown came by to see you. If he can't find you here, he'll call
you at home. He will be here tomorrow too.
∂15-Nov-84 1601 GLB
About the weight of questions in the midterm: I suggest 5 to the first two
questions and 10 to the other two.Is it reasonable?
∂15-Nov-84 1754 BARWISE@SU-CSLI.ARPA Important Meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 15 Nov 84 17:53:27 PST
Date: Thu 15 Nov 84 17:51:52-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Important Meeting
To: Initiators@SU-CSLI.ARPA, Cohen@SU-CSLI.ARPA, Halvorsen@SU-CSLI.ARPA,
Israel@SU-CSLI.ARPA
cc: Ingrid@SU-CSLI.ARPA
There will be an important meeting at noon on Tuesday, Nov 27. I will
try to keep it down to one hour. The purpose is to discuss some
important decisions about the future of CSLI. Please come of at all
possible. To keep the meeting a reasonable size, I am only inviting
the initiators. Jon
-------
∂15-Nov-84 1753 RPG
∂15-Nov-84 1652 JMC reply to message
[In reply to message rcvd 15-Nov-84 15:03-PT.]
The title translates to something like
Printed Scores in the collections in the Lenin Library catalog.
and the second item to something like
The piano student-pedagogical repertory. This suggests it includes things
that students learning to be piano teachers study.
However, the Stanford library system includes people who know Russian
far better than I do.
The issue is that they received some books, including this one, and some
proposed LC catalog numbers, and they are not sure that the russian book
corresponds to the LC number. So only a rough check was necessary. Thanks.
From my *very* rusty russian I figured out that it was mostly a listing of
piano works for students, but I couldn't tell whether it was scores or
discussions/studies based on scores.
-rpg-
∂16-Nov-84 1013 KAELBLING@SRI-AI.ARPA Learning
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 16 Nov 84 10:13:00 PST
Date: Fri 16 Nov 84 10:13:02-PST
From: Leslie Kaelbling <KAELBLING@SRI-AI.ARPA>
Subject: Learning
To: jmc@SU-AI.ARPA
I FTP'd two files over to SAIL. They are learni.txt[1,lep] and
enviro.txt[1,lep]. (The names made more sense before sail truncated
them). I'd appreciate any comments you have -- if you prefer talking
to typing, I can come by.
- Leslie
-------
∂16-Nov-84 1300 RA paycheck
I put your paycheck on your desk.
∂16-Nov-84 1430 RA
EKL program
Ron Burbak, who is a TV student in Colorado, wanted to know whether he can
get EKL program that you mentioned in your class @ Digital Corp. in
Colorado Springs. Please let me know, and I'll relay the inf. to him.
me know and I'll relay the information to him.
∂16-Nov-84 1442 JK
∂16-Nov-84 1435 JMC EKL to Digital
To: RA
CC: RTC, JJW, JK
[In reply to message rcvd 16-Nov-84 14:30-PT.]
The answer is yes, and Ross will help him do it, perhaps with additional
help from Joe Weening.
-----------------
What was the question that this was an answer to?
∂16-Nov-84 1510 RA
Please call David Chudnovsky (212) 864 5320.
∂16-Nov-84 1513 GOLUB@SU-SCORE.ARPA appointments and slots
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 Nov 84 15:13:20 PST
Date: Fri 16 Nov 84 15:12:39-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: appointments and slots
To: jmc@SU-AI.ARPA, knuth@SU-SCORE.ARPA, nilsson@SU-SCORE.ARPA,
pratt@SU-SCORE.ARPA
cc: bscott@SU-SCORE.ARPA
The meeting with Bower will take place at 9:30 on Tuesday, Nov 20.
I would like to meet with you at 9 am in my conference room to talk about
our strategy with the Dean. I'll send you a statement about slots on Monday.
Gene
-------
∂16-Nov-84 1531 RA 35 mm slides
Medical graphics and illustration can do it for your. It is $8.50 per
transparency. Do you want to do it?
∂16-Nov-84 1713 GOLUB@SU-SCORE.ARPA lunch on Tuesday
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 Nov 84 17:13:42 PST
Date: Fri 16 Nov 84 17:11:57-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: lunch on Tuesday
To: faculty@SU-SCORE.ARPA
Bill Spencer head of Xerox Parc will be at our lunch on Tuesday.
He's a friendly person and listens carefully.
GENE
-------
∂17-Nov-84 1252 GCOLE@SU-SCORE.ARPA Bibliography on Non-Monotonic Reasoning
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Nov 84 12:52:43 PST
Date: Sat 17 Nov 84 12:52:24-PST
From: George Cole <GCOLE@SU-SCORE.ARPA>
Subject: Bibliography on Non-Monotonic Reasoning
To: JMC@SU-AI.ARPA
Dear Prof. McCarthy,
Last Wednesday, at the Law and Computers Seminar, you stated that you
would be glad to send out a bibliography on non-monotonic reasoning to any
attendee who was interested. I would be grateful if you would forward that
bibliography to me (GCole@Score).
George Cole
-------
Rutie,
Please do the following. Update the shelf list of the non-monotonic
reasoning library. Get the bibliography from non-monotonic conference,
compare the two and make a combined list. Mark in some way the items we
don't have. Send a copy to Cole and put others in the non-monotonic file.
If you want an electronic copy of the Perlis bibliography, a request to
PERLIS@MARYLAND will probably succeed.
∂17-Nov-84 1758 SMC VCR
If you bring the Consumer's Report issues home with you I will examine them
for pertinant information
∂17-Nov-84 2019 GOLUB@SU-SCORE.ARPA help wanted
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Nov 84 20:19:36 PST
Date: Sat 17 Nov 84 20:18:22-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: help wanted
To: faculty@SU-SCORE.ARPA
17-Nov-84 20:12:20-PST,726;000000000001
Date: Sat 17 Nov 84 20:12:20-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: help?
To: gjl@SU-SCORE.ARPA
Diana Forsythe has recently returned by herself to live in the Bay Area.
She's looking for a job in the area. She has a Ph D in anthropology
from Cornell but is willing to do other things. She worked on urban planning
in Britain. Do you know of any jobs she might fit in? She's recently been
doing editorial work which she likes and she's very capable. Perhaps an
administrative job in a high tech company would be suitable.
She's also looking for housing nearby. She would be happy to housesit
for a while or could even rent an unfurnished place. I don't think money
is a problem.
Any help you can give would be appreciated.
GENE
-------
-------
∂18-Nov-84 1108 ENGELMORE@SUMEX-AIM.ARPA presidential address
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 18 Nov 84 11:07:40 PST
Date: Sun 18 Nov 84 11:08:07-PST
From: Bob Engelmore <ENGELMORE@SUMEX-AIM.ARPA>
Subject: presidential address
To: jmc@SU-AI.ARPA
Home Phone: (415) 322-0627
Office Phone: (415) 327-6600
John,
Here's a transcription, competely unedited, of your presidential address
at the aaai conference. I'd like to print an edited version of it in the
magazine, with your permission. If you agree, perhaps you'd like to take
a first whack at the editing. thanks,
Bob
There actually are expert system stories, and I'll take a little
bit of my time by telling three of them. The first one is a little
bit of a political expert system story. It was told to me by an
American labor leader about France. He said the French had a great
expert system that could predict the future. The President of
France asked it: what will be the rate of unemployment when my term
is up in 1988? And the answer was zero percent. He was pleased with
that. What will be the rate of inflation? Zero percent. What will
be the price of a loaf of bread? Two rubles.
Present when that story was told was an emigre from the Soviet
Union. He said yes, that the Russians had such an expert system, and
Bresniev was brought to it, and he asked it: How long until the Soviet
Union achieves Communism? And the computer gurgled for a while and
came back with the answer: thirteen miles. So there was great
consternation and finally it was explained: Comrade Bresniev, as you
know, each party congress is a step toward communism.
The third one was told by a general, an American general. He said
they had this expert system. Came the evil day and they asked it: are
the missiles coming across the ocean or over the pole?
The lights flashed for a minute or two and the machine said: Yes.
They typed back in: Yes, what? And the answer came back after another
minute: Yes, sir.
Well, so you see there are expert system stories.
Alright, so I'm going to talk about what is common sense and my talk is
in the main addressed to researchers in the field rather than attempting
to make a general summary of the state of AI for the public or for the
journalists or something like that. The reason for this apology is
I'm going to concentrate mainly on things that are unsolved, rather than
things that have been done. So I don't want to sound discouraged or
something. I have a habit sometimes of giving myself a fairly grandiose
title and now knowing quite what I am going to say and then doing my best
to live up to it. Sometimes this is more successful than at other times.
I think this time the success will be judged to be quite moderate.
But anyway, common sense, as a topic, has had its ups and downs in AI,
but now seems to be an up. In particular I want to mention especially
in Northern California, I want to mention the common sense summer that
Jerry Hobbs talked about, which SRI and CSLI at Stanford are doing
jointly.
Let me now start. We have "What is Common Sense?" and as you see, the
answer is at the moment slightly evasive. It doesn't really answer
precisely, but in any case I'm going to break it down and discuss these
three topics.
I want to sort of pose a problem. Common sense is intended for successful
behavior in a complex world. Here we have a picture of a world in which
the trash cans are not standing up as they ought to be. To add an
additional piece of information, I will say that this has been observed
to be a recurrent phenomenon. The question is what to make of that, and I'll
come back to that later as to the various things which are involved in
the statement, the understanding of what is the matter, and what to do about
it. Well, maybe I'll say a little bit. We're going to infer that the dogs
are responsible for this. And what to do about it turned out not to be a
very easy problem for me to solve. It took me some weeks to decide what
to do.
Ed Feigenbaum asked a question about common sense. There is some idea that
maybe giving computers common sense is a task which is qualitatively
similar to the excurrent expert systems, and it's just a question of a
very large number of pattern-action rules of the conventional kind. As
I see it, this isn't so, except that there is a way out by cheating, since
pattern-action rules are universal. If you like some other formalism, you
can make pattern-action rules that will interpret this other formalism.
Well, we don't want to let them out that way, because you still have to do
the other formalism. But, nevertheless, I had to qualify my "no" answer
so that it would be correct. And, of course, the question is: what is it?
Now as Neil said, if we really understood how to represent common sense
knowledge in a general way, then we could have this common sense data
base. And, as you can see, there are differences of opinion about how
large it ought to be or would have to be to be useful. My opinion is
that it wouldn't have to be so terribly large.
Now as Neil said, I've been interested in this problem for a long time.
In 1958 I wrote a paper called "Programs with Common Sense" which proposed
to do what is described on this slide, to represent these things as
sentences of mathematical logic, the general facts about the effects of
events and actions especially, the goals to be achieved, a general
principle that one should do what achieves one's goals and then have various
ways the facts of the particular situation into the computer. For
example, the observations of the television camera might result in
sentences and so forth.
Then we could, in principle, reduce the problem to mathematical
logic. Namely, we try to deduce a sentence of the form should-action
and then we do that action.
So the original idea was to actually write a program that would work
in that way. Actually even in the 1958 paper, this proposal was
qualified by the idea that of course you might have all sorts of special
purpose programs which could do some of the work whenever that was
efficient, and which would then be controlled by the logic.
Now in Allen Newell's 1980 lecture on the logical equivalent of this
podium, he talked about the logic level and made the point that whether
the program actually operated by manipulating logical formulas or not,
one could think about it on the logic level, as he called it. And one
could discuss what the program believed and what inferences it was
capable of drawing. Well, the programs with common sense idea, the
name that was used at the time was "advice taker", was not something
that was successfully put into operation, and it wasn't very easy to figure
out why, that is, what was wrong with it. But like all AI systems it
turned out to be extremely brittle. Everything that you did turned out
to be extremely specialized. Now one thing that turned out to be true
was that ordinary logical deduction has to be supplemented by some form
of non-monotonic reasoning. I have to mention that I didn't know that
until somehow the middle 60's, and I didn't have any idea of how to formalize
it til the middle 70's. So the formalized non-monotonic reasoning turned
out to be quite a hard problem. It actually turned out that around the late
70's there were several different approaches to non-monotonic reasoning
developed. There was in particular Drew McDermott and John Doyle developed
this non-monotonic logic and Raymond Ryder developed his logic of defaults
and I developed a system that I call circumscription. Maybe I'm getting
ahead of myself on the slides.
I'll talk a little bit more about non-monotonic reasoning later.
To put the problem a little more sharply, that is, the logic part of the
problem, we can talk about the epistomology of common sense. Now
epistomology, if you look in the dictionary, is the theory of knowledge,
and in particular, its limits and its methods of getting knowledge and
so forth. Naturally it is a term that we are attempting to swipe from
the philosophers. I believe that we have sort of half got it out of their
hands and will have it completely in another ten years or so.
From the scientific point of view, what we are trying to do is to split up
the AI problem into managable parts, and in particular, to separate the
epistomological problem from the heuristic problem of programming the
search for useful inferences, of programming the pattern matching which
may be required in order to do useful inferences. This is somewhat
controversial. I guess, on the whole, opinion in AI has gone to the
idea that this is a useful thing and that it can often be done, although
various people will say "yes, but it can't always be done", and of course
you have to agree with that.
The key thing that ought to be in this lecture is a catalog of the
areas of common sense knowledge. Well, what is it that people know?
If you will look at this list that I have put down a little bit
critically, you will say, well, I'm not sure he's got it. And you ask
me and I will say I'm sure I don't, that these are different subjects
that have been thought about. Now the one which has gotten the most
action in AI has been this question about the effects of actions and
other events. Formalizing this was done in the 60's and it's also
the core of the work in AI on planning, about which Stan Rosenshine
will talk this afternoon.
Now another area that I've just been really beginning to think about
requiring to formalize is the relations between appearance and reality.
Now even to mention this involves some philosophical presumptions.
As the question of philosophical presumptions is an old one, barhillel???
attacked my 1958 paper on the grounds that it had some. And he's
certainly right. There are some philosophical presumptions. And to
axiomitize the relation between appearance and reality is to assume
that both exist, among other things.
Now the interesting thing about the relations between appearances
and reality is that what you want to do, of course, is go from appearances
to reality. However, when you make rules that do that, they turn out
to have endless exceptions. Whereas, the knowledge which turns out to
be stable is the knowledge that goes from reality to appearance. In
the sense of well, if you have an object here and the lighting is such
and such and the observer is there, then that's what it is going to look
like, but one needn't think only about visual appearance. We could
talk about a relation between social appearance and social reality. If
this guy doesn't dislike me and he's close to the salt and I say pass
the salt, well, then he'll do it.
Certainly in AI there has been a lot of talking about the relations
between parts of objects and the iza??? hierarchies, which have gotten
quite a lot of play recently, and this is beginning to be understood
reasonably well. My own intuition is that it has been given a little
bit more importance than it deserves. Knowledge and belief has been
examined. I put in there vision is a dynamic process simply because
I was going back to this appearance and reality. If we go back to the
talk that Alex Pendlem gave yesterday in the prize paper session,
then he talked about going from a general concept of an object and from
that to how that object would look, and then matching that against a
scene. And certainly many people have proposed to vision in that way.
This all involves common sense.
We have communication as a process.
Now I want to mention something. Let's see, I won't mention that last
one yet because there's one I forgot to put on the slide. That is that
I have been arguing a lot about that pattern-action rules are not an
adequate form of common sense knowledge, but it was a mistake to
leave them out altogether. So I want to say that rules of the kind, that
is, there is a large amount of common sense knowledge which does have the
form of: if you see this, then do that. So it was a mistake to leave
it out. I just put it in at this point so that I wouldn't forget it
entirely.
Now I want to mention natural kinds. This is a discovery of the
philosophers, and it's a moderately recent discovery. I haven't managed
to figure out just exactly which philosopher should be credited to it.
I think Hillary Putnam gets certainly some share of the credit. But the
idea is this. Suppose we try to define some kind of an object. An
example might be a lemon. So somebody says it's a small yellow fruit.
Then you send this child to the store and you say, by the way, buy me
a half dozen blue lemons. Lo and behold, they happen to have in the
store a fruit that smells like a lemon and is very like a lemon in other
ways. It produces something that seems to be lemon juice, but it's blue.
And I think we could accept that.
For example, some geneticist going to work could develop a blue lemon.
So the question is, how can you say that such a thing is a lemon. We
thought it was part of the definition of a lemon that it be yellow. The
philosophical answer of natural kinds is that this represents really an
observation about the world rather than something solely done in
philosophy, is that things really do clump in that you could imagine
trying to make a definition that would distinguish a lemon from an orange,
let us say, and that it be quite arbitrary if there were a continuum
of fruits between lemons and orange. But fortunately for us, there is
not a continuum of fruits between lemons and orange. So almost any
rule will work. Furthermore, there are all kinds of variations on lemons
which would still be close to the kind of a lemon.
In particular, when we talk about a natural kind, our tendency to make
definitions is partly frustrated by the fact that a given individual who
can do perfectly well at distinguishing lemons from oranges doesn't even
know all the properties of lemons. In fact, maybe even science, certainly
science itself, doesn't know all the properties of lemons. But we regard
a lemon as a kind of natural kind.
Now what does this say for AI? What it says for AI is that our program
shouldn't entirely try to work with definitions. If they do that, they will
be very rigid. It should accept the fact that there are such things as
lemons and that it does not know all the properties of lemons, and that there
are more of them to be discovered. In any case, that does represent a
discovery that the philosophers made which is useful to us.
I seem to have covered the top about that. In talking about appearance
and reality. And then mention some specific facts. One of them
relevant to this particular problem is that dogs sometimes look for food
in trash cans. And we can jump to a conclusion that an overturned trash
can was overturned by a dog. But it is also true that mischievous children
sometimes overturn trash cans. And fleeing burglers sometimes run into
trash cans. To mention an example that you probably didn't think of.
As you can see, this is a little bit disjointed. And the reason that
it is disjointed is that once can discover a lot of facts about common
sense. that's all I've really been able to do, rather than come down
with a nice, solid definition.
The next one comes in and this is a sort of interesting phenomenon that
I think gives some difficulties for AI. Suppose we say that a container
is sterile if all the bacteria in it are dead. Then we could put that
definition as a clause or a couple of clauses in a prologue program and
it would actually involve a knot (not?) that is to make the thing in a very
straightforward way. However, if you put it in a prologue program, then
there is only one way really in which, or two ways rather, in which a prologue
program would use the fact. One is that if you want to know whether a
container is sterile, well then you check all the bacteria to see if they're
dead. So it would easily generate a program that would do that, except
that the part of the program that had to find the bacteria and look at
them wouldn't be easy to write.
Or if you want to kill them to sterilize the container, then you could, of
course, kill each of the bacteria. But this knowledge I want to characterize
as theoretical, even though it's entirely useful, because we don't sort of
compile it directly. Instead we use the theory. Namely, if we want to
sterilize a container, then we say bacteria can't stand heat, so we heat
the whole container and we say, according to theory that ought to kill
all the bacteria in it without our having to find each and every one of
them. Or we poison it in some way, with some bactericide. Similarly, if we
want to test whether the container whether the container is sterile, then
we have this theory about how bacteria will grow in a suitable medium, and
we use that.
Now the point about this, well there are two points about it. One is that
maybe you could handle a little bit about whether that's common sense or
we've gone beyond common sense in this. I think at the moment I favor
trying to include this much theoretical knowledge in common sense. The
other point is you could argue: well, is this really the difference between
theoretical knowledge and, you might say, practically usable, immediately
usable knowledge. Certainly one can say this. That the notion that a
container is sterile if all the bacteria in it are dead is not directly
usable without some additional facts about what kill bacteria or how
bacteria behave.
Of course and important problem for AI, I think, is going to be able to
use such knowledge. To give an example that is certainly well-known
to its programmers, in the development of MYCIN, the well-known expert
system for recommending diagnoses and treatments of bacterial infections
of the blood, the theoretical knowledge is not directly present. The
experts on bacterial diseases were induced to try to translate or to use
their theoretical knowledge to produce practical rules of thumb. Well,
my opinion is that that won't always work.
Now I want to return to one of the topics of common sense
on which perhaps the most work has been done and this has to do with the
effects of actions in achieving goals. In 1969 Pat Hayes and I wrote a
paper called "Some Philosophical Problems from the Standpoint of Artificial
Intelligence" in which we proposed this result formalism. So we introduced
the notion of situations, denoted by S in these formulas, and we have an
event, so S prime equals result of E and S is the new situation that results.
Now what we want to have are a lot a rules which describe for particular
kinds of situations and particular kinds of events some properties of the new
situation that will result.
There's another idea which is involved in this situation calculus which I
would like to recommend to your attention. That is that we regard a situation
as being undescribable completely. So the situation in this room today -- no
human will ever be able to say exactly what it is. In fact, we can imagine
that it contains an infinite amount of information. All that you can do is
say things about it.
Now it turns out that it is a key problem of artificial intelligence or a
key aspect of useful formalisms that they contain both finite objects or
that they refer to both finite objects that can be completely described and
to objects that cannot be completely described.
Now in the situation calculus formalism, the situations are infinite
objects and the events are finite. That is, putting one block on top
of another one is taken as finite. However, it seems that one might
consider a formalism that made the events also to be infinite objects so
that we have an event, for example, which is putting this paper clip on
the podium. Sorry, which has the property that it is an event of putting
a paper clip on the podium, but it had all sorts of additional properties
that it was done clumsily, that it took a half a second, and so forth and
so on. So we can imagine events as having infinite collections of
properties, as well.
Well, when this sitution calculus was proposed as a means of describing
the effects of events, certain problems arose. One of them is called
the frame problem, and it was how to avoid specifying everything that
doesn't change. If you, for example, imagine moving blocks and painting
them, then you rapidly discover that you need some axioms, or you seem
to need some axioms that say that moving something doesn't change its
color, and painting it doesn't change its position. Otherwise, the new
situation that results from an action is insufficiently described for
you to determine what happens next. Humans don't seem to have a lot of
difficulty with that kind of thing. So it was a question of how to
adapt our mathematical logical formalisms so that they wouldn't either.
And that took a while.
Another problem that came in was the qualification problem, how to avoid
endless qualifications in axioms. This is a problem not quite under that
name that Marvin Minsky has emphasized in discussing the need to qualify
the axiom that birds can fly. So he says, well, what about all these
exceptions of dead birds and penguins and birds that have had their
feet encased in concrete and other examples of that kind.
Now the point about that last example is that you might imagine that
your common sense data base would include the facts about penguins, and
you could imagine saying a bird can fly if it is not a penguin and it
is not an ostrich and so forth and so on. But you can't imagine that
you could catch up with Minsky's ability to invent exotic reasons why
a bird might not fly. Ok, so one would need formalisms then that allow
that. Now there are two approaches. One is to get discouraged about
logic and the other one is to modify it. Naturally, I've been one who
has been interested in formalizing non-monotonic reasoning.
I've mentioned non-monotonic reasoning, and, of course, I should say
what monotonic means in this connection. So we say that if you infer
a sentence P from a set A of premises and you have some larger set of
premises, then P is inferred from B. Logical reasoning is monotonic
and it's monotonic for rather fundamental reasons that doesn't depend
on the particular logical system. For example, if you take the logical
notion of a proof as being a sequence of sentences, each of which is
either an axiom or a premise of some kind, or follows from some
preceding sentences by an allowed rule of inference, then without
saying any more than that, you're already commited to a monotonic
system. Now common sense reasoning includes non-monotonic steps. One
example is that if you hear that I have a car here, you might ask me
for a ride, but then when you hear that my car is out of gas, then
you might decide that's unappropriate. But then you see me with this
gas can approaching the car, and you decide, well, maybe I'll ask
him for a ride afterall.
When you add a new fact, like the car was out of gas, then you can
lose a conclusion that you previously drew.
Now as I mentioned, there are these three approaches to non-monotonic
reasoning that are in the special issue of ARTIFICIAL INTELLIGENCE
in April, 1980. All three of these approaches have been subsequently
developed. One can ask what's the difference between these formal
non-monotonic reasoning systems and just including defaults. And
the goal of the formal non-monotonic reasoning, or at least the goal
of circumscription, the one that I'm pursuing, is to achieve a
considerably greater degree of generality so that we can handle all
of Minsky's problems.
Let me mention one that comes up in missionaries and cannibals problem.
You're given the usual missionaries and cannibals problem, let us say,
in English. And you're discussing it with this dunce. And he says:
well, why don't they cross on a bridge? And you say: it doesn't say
there's a bridge. And he says: it doesn't say there isn't a bridge.
Now you don't want to go around qualifying the problem. What you want
to do is to appeal to some kind of principle that says at least in
a puzzle the present material objects are to be taken as those that
can be inferred by common sense from the statement of the problem,
including, of course, not merely common sense, but general common
sense knowledge.
The missionary and cannibals problem has all sorts of defaults in it.
It mentions that there's a boat, but it doesn't say that the boat is
operable. But it is a kind of default rule that a tool is usable
for its intended purpose unless there is other information to the
contrary.
Now in the puzzle, things are rather straightforward because the
non-monotonic inference rules can be taken as more than just conjectures.
In real life, the non-monotonic rules are never conclusive. They are
rules of conjecture rather than rules of inference.
So anyway, one wants to say there that the objects that are present
are just those that have to be. Or you want to conjecture that.
Now I thought that I ought to put in some formulas, just so that the
journalists won't think they understand everything. This is one of
the current forms of circumscription. We are talking about some
predicate vector P. You can think of it as a single predicate. For
example, on XY, that is, X is on Y in some particular case, so on
is the predicate in question. It can have one or more arguments.
And then E of P and X is a formula involving this predicate. And
X is a free variable in it. And we would like to make it false for
a maximal set of values of X. If we could, if it was compatible with
the axiom, we would like it to be always false. But normally we
will, on the interesting cases anyway, the axiom about P will be
such that we can't make it always false. And now we have this formula
that says that it is as false as possible. A prime of P that I've
written down there is the definition of this new property of P. In
other words, we say that P not only satisfies A, but it satisfies it
in such a way that E is as false as possible. So this is this A prime
of P. And so first of all it has to satisfy A. And then we say AND
and we have A for all P prime here and that of course makes this a
formula of second order logic. I've been a fan of first order
logic for many years, but I've just gotten myself sort of pushed off
into second order logic for the benefit of this circumscription
thing. So what we're saying is that for all predicates P prime that
also satisfy the axiom such that whenever E with P prime in there is
true, then E with P is true. Then that's only possible if the E with
P prime is equivalent to the E with P for all X's. So that is a
kind of formalization in an extension of ordinary mathematical logic
which permits you to do some non-monotonic reasoning. Now the extension
is the decision that certain formulas are to be circumscribed, that is,
are to be minimized. We talk about circumscribing E of PX, that's what
I call it, formula circumscription.
The point is that if you have made
that decision that you are going to minimize E of P and X, then what
you will get depends on the axiom A. The axiom A is the set of facts that
you take into account. If you take into account more facts, then you may
have lesser ability to minimize it.
Now to give a particular example of this, I will show some more formulas.
These have to do with moving and painting blocks. The idea in this
particular case is to demonstrate a solution of the frame problem.
The first formula here is a statement that things don't change their
location without a reason. So the righthand half of this formula says
that the location of X in the result E and S is the same as it was
before. The lefthand side, of course, of this implication is then a
premise and that says that unless some aspect of X, the object and
the event in the situation is abnormal, then this is true. So this\
is an equivalent in some sense, though more general, of a kind of
strips assumption that things don't change their locations unless
there is a reason.
The second one simply says that things don't change their colors unless
there is a reason. But for something to change its color, it has to
be abnormal in a different aspect than in the case of changing its
position.
The next one is a sort of a key thing. It says that in the action of
moving X to L, it is abnormal in aspect one. So that says with regard
to this particular action that it has the effect of turning off this
rule.
Now just having given that much, let me say a little bit about the
role of circumscription in this. The thing that we are going to
circumscribe in order to use these rules is abnormality. We are
going to circumscribe the formula AB Z. I should've written it
up there. But in any case we are going to make as few things
abnormal as possible. And what this says is: well, there's no
help for it. If you move something then, at least in this aspect,
it's abnormal. It might move. Its location might change.
Then we have something that says, indeed, unless there's something
abnormal when you do move something, then its location to a location
L when you perform this action, then it's going to be located at L.
The next two have to do with painting and treat them in a very
similar way that moving was treated. This one turns off the axiom
that things don't change their colors for the particular action
of painting it, and this one says that unless something further is
abnormal, it really does change its color suitably when you paint
it.
Then there are a few little facts here which say that, well, things
might be abnormal, namely, in aspect three, namely if the top of
the object that in this particular blocks world, if the top of the
object we want to move is not clear, or if the location where you
want to move it is not clear, or if the object is very heavy, or
you're contemplating moving the object to its own top, then it is
abnormal, and therefore you cannot conclude that it will move
there. Then there's some stuff about things, the definition of
clear, that doesn't have any abnormalities in it. And then
finally we have something that, unless we know something is a
trivial object, like a speck of dust, that's what I mean by trivial
in this case, then it's assumed to be not trivial.
So this represents at least one approach to extending the use
of first order logic in order to handle these things that I didn't
handle before. And, therefore, trying to say, well, this is an
approach toward devising suitable axioms that one could hope to put
in a common sense data base about moving objects. My opinion is
that we're not there yet by a fair margin. These are more general
than some things that have been done, but still not general enough.
I've put in the solution to this problem at this point. I really
should have given a little propaganda before I put up this slide.
Let me mention a little bit that there remain quite a few problems
before we can put stuff in the common sense data base that would
enable a computer program to solve this problem, or even less, to
accept a solution to it, and presumably to reject other solutions.
Let's talk about rejection first. So you say these dogs are
knocking over the trash cans. Well, why not chase away a dog
when it shows signs of knocking over a trash can? Of course, the
answer is, that's fine, if you happen to be there, but you can't
afford to stay around your trash cans all the time, waiting to
chase away dogs.
Now this little bit of human common sense reasoning does require
some kind of formalization, but you really want there, first there
is to have the facts in your common sense data base that refer
to repeated events that enable you to say, well, how much that
you would really have to stay out there all the time, and so forth
and so on. Then a lot of people have emotional reactions to
this problem, that is, they think about attacking the dogs in
some way or attacking their neighbors in some way, if it's the
neighbor's dog. I was never sure about whether it was the neighbor's
dog, or whether it was perhaps my dog that was doing this.
One TV producer of my acquaintance even said, well, what I did was
put lye in the trash cans. I regarded this solution as morally
unacceptable, and it probably wouldn't work anyway.
So the eventual solution turned out to be to go down to the
hardware store and buy a couple of hooks and hang the trash cans
on the hooks. Now we need two things to say. One is we'd like
and argument that that will work, but then it is also relevant
that I tried it and it did work.
Now let me go through a few more aspects of common sense reasoning.
This one has to do with human behavior. What I want to illustrate
here are two problems of common sense. The principle of rationality
is one that Allen Newell mentioned in his first AI Presidential
address. That is, he gave the first AI Presidential address. I
don't know whether he would agree to be elected president again, to
give a second one. So the principle of rationality is that it will
do what it believes will achieve its goals. And this was discussed
in the following aspects. We would like to be able to ascribe
beliefs and goals to machines, or at least we've discussed this.
That is, Newell discussed it, I've discussed it in various places.
And roughly speaking, what you do is actually the reason why we
ascribe beliefs and goals to each other, to other human beings, is
that a substantial part of human behavior, and we hope at some time
of behavior of certain kinds of programs, can be accounted for by
the ascription of beliefs and goals.
Now this can get elaborated in various ways. Well, maybe it won't
do it because some obstacle may arise, so we can elaborate it by
saying that it intends to do what it believes will achieve its
goals. Otherwise, we could contract it. It will do what will
achieve its goals or it will even achieve its goals. Let me
propagandize a little bit for some of the contractions as being in
some sense present in the data base. Suppose I say, well, that's
all on this slide. Then you imagine I'll push the button for the
next slide. You say, it will do what? It will achieve its goals.
Now you don't do this by saying it intends to do what it believes,
McCarthy intends to do what he believes will achieve his goals. He
wants to show the audience the next slide and he believes that
pushing the button will produce the next slide and, therefore, he
intends to push the button. You say: he wants the next slide,
he'll push the button. So this represents a kind of non-monotonic
contraction. It is non-monotonic because there might, after all,
be some exceptions. You can imagine that I am suddenly struck
by some mental effect and have forgotten that pushing the button
will change the slide.
Now the point is that we need contractions and elaborations and
the principle, and common sense reasoning manages to go back and
forth among these things fairly neatly.
That's just another example of this kind of thing. I probably,
having explained the other one fairly well, I don't really need
this one.
Now there are lots of open questions about common sense, and so I
want to mention a few to terminate this lecture. The biggest one,
which has been hanging around for a long time in terms of formalization,
is how to handle concurrent events. While I am doing this, something
else is occurring. There doesn't really exist any good axiomatic
theory of this. Now curiously enough, there exists of course a theory
of computer programs, but it doesn't seem to be very relevant. First
of all, it is to this AI problem, it's in a large measure concerned
with ways of achieving synchronization, and that isn't something that
we ordinarily have to think about in talking about: while I am
giving this lecture...something else is happening somewhere else,
or, perhaps the audience is getting impatient, or whatever.
Another notion I want to mention has to do with approximate theories.
Let me explain this one a bit. We might regard the world as
deterministic in the sense that the present state determines all of
the future states, or it determines them probabalistically, or it
determines them quantamechanically, it doesn't much matter exactly.
But in terms of our common sense thinking, we use approximate theories
that are very far from deterministic, namely, the theory uses a model
that has inputs from the outside. The example I want to give is the
following. Two ski instructors are watching their student and the student
falls down. One of them says: He fell because he didn't bend his knees.
You're supposed to do that. The other one says: no, that's not right, he
fell because he didn't put his weight on his downhill ski when he was
turning. You're supposed to do that, too. So then they look at a movie
and one of them agrees that the other one was right. Now the theory
that they have of skiing is a kind of stick figure theory. Furthermore,
it has a kind of input from the outside, namely, they're not concerned
with the psychology of the student as to why he didn't bend his knees, or
at least not at that level of the argument, or why he didn't put his
weight on his downhill ski. They believe that if you were skiing straight
and if you don't bend your knees, then you're likely to fall when you
hit a bump. And similarly for the consequences of the other event.
Granularity is a slogan now that Gerry Hobbs is using to discuss
similar phenomena.
Well, here are some other problems. The next two there, which facts
can be used directly in pattern-action rules and which facts can be
used directly as fragments of logic programs, is related to this
example that I gave of the sterile container.
Now another remark is that the same fact is often used in various
ways. We don't know how to express heuristic information as facts.
We have a lot of problems with maintaining modularity.
This is my last slide. I want to mention a couple of other things.
Quite some time ago, maybe the late 60's even, Hubert Dreyfus wrote
a book, WHAT COMPUTERS CAN'T DO, which was a sort of an attack on
artificial intelligence. It has sort of a journalism part and the
journalism part was saying: look, so-and-so said this would be done
by this date and it wasn't. Or so-and-so exaggerated the performance
of this program. But then it also had this part about saying, well,
there are these thing that computers lack and must lack. Now the
argument that they must lack was not given. But among the things
that computers were said to lack was ambiguity tolerance. It really
wasn't said what ambiguity tolerance was.
But here is my example
of ambiguity tolerance. Suppose a law is passed saying it's a crime
to attempt to bribe a public official. And for twenty years some
people are tried for this and some are indicted for this, some are
convicted and some are acquited. After twenty years along comes
some smart lawyer and says you've shown that my client offered
this man $5000 to see if he could get out of his drunk driving
conviction, but you never proved that my client knew that the man was
Commissioner of Motor Vehicles. My client might have thought that he
was just another lawyer. And the fact that he really was Commissioner
of Motor Vehicles is irrelevant. So does attempting to bribe
a public official involve essentially knowing that the individual
is a public official. That's the first kind of question.
The second one was: well, you've offered evidence that my client
offered this man $5,000 to fix his drunk driving conviction under
the impression that he was Commissioner of Motor Vehicles, but as
in fact we see that the Governor had never signed his commission
properly. So the man, although everyone thought he was, was not
in fact a public official.
So does attempting to bribe a public official involve the person
you were offering this money to must actually be a public official,
or is it sufficient that you only think so?
Now as it happens, philosophers and lawyers are interested in this
kind of question and will haggle over it. From the point of view of
AI there is something much more important than that and that is the
twenty years that went by before anybody found a problem. Here
we have a situation where this concept was inherently ambiguous, and
indeed both the philosophers and the lawyers find it ambiguous, and
the judges sort of decide it in an ad hoc way.
In a related problem of conspiracy to assualt a federal official,
the courts found against the criminals on both grounds. If you hit
this federal official, it was a crime. You were assaulting a federal
official, even if you didn't know it. And if you hit somebody else
thinking he was a federal official, that's still the same crime.
What's involved here from the AI point of view is it is clear that AI
would be in real trouble if in order to get common sense we had to
solve all problems of ambiguity in advance. So we need a formalism
that will use some kind of non-monotonic reasoning, which will say,
well, this concept may be ambiguous, but it isn't ambiguous in this
particular case unless there is some reason to believe it is.
So I should mention that my current cure-all for all the problems of
AI is non-monotonic reasoning, if you haven't guessed that already.
So ambiguity tolerance can be treated in this way.
A further problem, which is sort of related, is what I have come to
call elaboration tolerance. That seems to be that we have various
simple rules for dealing with situations, but we can elaborate them
in some arbitrary way. To take the most simple elaboration, after
I get done here this afternoon, perhaps I will drive my car back to
the hotel. But then it turns out that we have to elaborate that,
namely, the car is in fact hopefully not entirely out of gas, only
almost out of gas, and, therefore, I want to go by some gas station.
But you can think of still further elaborations that might be required
in terms of the simple action. Like, if there's this ticket on it,
well, then I might have to do something about the ticket, and so forth,
and so on.
So let me summarize by emphasizing the apology that I made at the
beginning, because now you will probably be more prepared than you
were at the beginning to believe that an apology is called for. Which
is to say, I feel that I have not been able to answer, except in the
evasive way of my first slide, the general question of what is common
sense, but I've been able to say various things about common sense,
some of which are, I hope, relevant to the construction of artificial
intelligence systems.
Thank you.
-------
∂18-Nov-84 2147 GOLUB@SU-SCORE.ARPA Re: Science Digest young scientists
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 18 Nov 84 21:47:09 PST
Date: Sun 18 Nov 84 21:46:20-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Re: Science Digest young scientists
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 18 Nov 84 13:20:00-PST
I would like to see the article.
GENE
-------
∂19-Nov-84 0830 CLT
∂18-Nov-84 2207 JMC (on TTY20 2207)
How long is Samson and Delilah likely to be?
focus magazine has it listed from 9pm to 11pm
∂19-Nov-84 0937 RESTIVO@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Nov 84 09:37:41 PST
Date: Mon 19 Nov 84 09:37:25-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 19 Nov 84 08:26:00-PST
embaressment, yes
Professor, immediately. They should be as follows:
1.] P(i(x,i(y,x)))
3.] P(i(i(n(x),n(y)),i(y,x)))
I will send out a correction this evening. Thank you.
-------
∂19-Nov-84 1012 RA
There is no neel.1 in let,
∂19-Nov-84 1014 RA
I couldn't find neel.1[let,jmc]
∂19-Nov-84 1016 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 meeting reminder
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 19 Nov 84 10:16:31 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Mon 19 Nov 84 10:14:44-PST
Date: Mon 19 Nov 84 10:15:25-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: F4 meeting reminder
To: f4@SU-CSLI.ARPA
Don't forget tomorrow's F4 meeting.
--Bob
---------------
Return-Path: <@SU-SCORE.ARPA:BMOORE@SRI-AI.ARPA>
Received: from SU-SCORE.ARPA by SRI-AI.ARPA with TCP; Fri 9 Nov 84 15:51:59-PST
Received: from SU-CSLI.ARPA by SU-SCORE.ARPA with TCP; Fri 9 Nov 84 15:47:02-PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Fri 9 Nov 84 15:48:03-PST
Date: Fri 9 Nov 84 15:47:13-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: next F4 meeting
To: f4@SU-CSLI.ARPA
The next meeting of project F4 will be Tuesday, Nov. 20, at 3:15 in
the Ventura seminar room. We will be discussing chapters 5-7 of
Gil Harman's "Change in View". (Chapter 5 was scheduled to be
discussed at the last meeting, but we didn't get to it.) We will
finish up the Harman manuscript at the following meeting.
In case there is any confusion, we sticking to our original biweekly
schedule. Some of you may have heard that we were going to slip the
schedule by one week because of "Emotions week", but that plan was
abandoned because of other conflicts.
-------
-------
∂19-Nov-84 1100 GOLUB@SU-SCORE.ARPA Karp
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Nov 84 10:59:53 PST
Date: Mon 19 Nov 84 10:57:56-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Karp
To: faculty@SU-SCORE.ARPA
cc: norine@SU-SCORE.ARPA
Reply-To: norine
Dick Karp will be visiting the department on Friday, Nov 30.
Let me or Norine know if you would like to see him.
GENE
-------
∂19-Nov-84 1123 INGRID@SU-CSLI.ARPA Betsy's Memo of October 8, 1984
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 19 Nov 84 11:23:47 PST
Date: Mon 19 Nov 84 11:20:05-PST
From: Ingrid Deiwiks - 497-3084 <INGRID@SU-CSLI.ARPA>
Subject: Betsy's Memo of October 8, 1984
To: Researchers@SU-CSLI.ARPA
cc: Administration@SU-CSLI.ARPA
There is a typo in the above memo. On the attached telephone list,
Tom Wasow's telephone number should be 7-1855.
Ingrid
-------
∂19-Nov-84 1228 RA
I put two letters on your desk to be signed.
∂19-Nov-84 1400 RA
reinfr.1[let,jmc] on your desk for your signature.
∂19-Nov-84 1641 GOLUB@SU-SCORE.ARPA meeting
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Nov 84 16:41:45 PST
Date: Mon 19 Nov 84 16:39:08-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: meeting
To: knuth@SU-SCORE.ARPA, pratt@SU-SCORE.ARPA, mccarthy@SU-SCORE.ARPA,
nilsson@SRI-AI.ARPA
cc: bscott@SU-SCORE.ARPA
I had meant to send you a statement summarizing our billet situation.
Unfortunately, I was unable to get to it today. We do have quite a
few statistics which I will hand you tomorrow. Remember we meet at 9
in my conference room.
GENE
-------
∂19-Nov-84 1645 CHEESEMAN@SRI-AI.ARPA Proposed Workshop
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 19 Nov 84 16:45:33 PST
Date: Mon 19 Nov 84 16:45:17-PST
From: P. Cheeseman <cheeseman@SRI-AI.ARPA>
Subject: Proposed Workshop
To: jmc@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
To: John McCarty, President AAAI.
From: Peter Cheeseman (SRI International) and
John Lemmer (PAR Corp.)
cc: Claudia Mazzetti
Subject: Proposed Workshop
This letter is to request AAAI support for a workshop on:
"Probability and Uncertainty in AI"
To be held on 14-16th August, 1985 (just prior to IJCAI).
at University of California, Los Angeles
The purpose of this workshop is to bring together those who have an
interest in using probability theory (or its near equivalents) for
solving the problems associated with representing and reasoning
about uncertainty in AI. In particular, we are encouraging papers on
the following subjects:-
*The relationship between logic, non-monotonic logic and
probability
*Use of probability (and Baye's Theorem) for inductive inference
*Use of probability for prediction and estimation (especially in
expert systems).
*Higher order probabilites (probabilities of probabilities)
*Interpretations of probability (e.g. as a measure of belief,
frequency etc.)
*Procedures for efficient compuation of probabilities in particular
cases.
*Commonly used probabilistic assumptions (e.g., independence and
conditional independence)
etc. (we are open to suggestions)
It is intended that the workshop will have limited attendance
(approx. 50 people), that quality papers be sought and accepted
by review and a procedings be published. Any profits from procedings
sales will go to AAAI (negotiations with Kaufmann are continuing).
We look forward to your cooperation...
Peter Cheeseman and John Lemmer.
Peter Cheeseman and John Lemmer
-------
∂19-Nov-84 1742 SMC dinner?
what's the plan.
∂19-Nov-84 1745 SMC
I don't see any sign of her. She could be here asleep, but that seems unlikely.
Perhaps she is over using pne of the practice rooms.
∂19-Nov-84 2237 GOLUB@SU-SCORE.ARPA lunch
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Nov 84 22:37:18 PST
Date: Mon 19 Nov 84 22:35:23-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: lunch
To: faculty@SU-SCORE.ARPA
Bill Spencer will be at lunch on Tuesday. Klaus Wirth may join us.
GENE
-------
∂20-Nov-84 0338 RWW new FOL
I am beginning to build a new FOL. Do you want to be on the memo
list?
Richard
∂20-Nov-84 0908 RA
Are you going to make it to the 9:00am meeting with Golub?
∂20-Nov-84 1153 YK
From: RWW
To: FOL interest group
Date: NOV 20 1984
Hi,
This is the first of some information on the new FOL.
1) I almost have new FOL reading and writing wffs. All is translated,
the basic scanning primitives work (I think) and I need debugging
help. Volunteers accepted.
2) Top level almost ready. Decisions need to be made about error
handling, but all else looks ok. Does anyone know any LISP
that can't be forced to do an old fasioned ERRSET? I'd like
feedback on this.
3) I would like to take a survey about who would like to bring FOL
up in which LISPs. Please send you ideas back to me and I will
collect them together.
4) The next "full" meeting of the group will be Monday NOV 26 at
11am staring in my office. Bring your friends.
Richard
∂20-Nov-84 1303 @SU-SCORE.ARPA:JMC@SU-AI.ARPA Industry lecturers
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Nov 84 13:03:26 PST
Received: from SU-AI.ARPA ([36.36.0.194].#Internet) by SU-SCORE.ARPA with TCP; Tue 20 Nov 84 13:00:24-PST
Date: 20 Nov 84 1259 PST
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: Industry lecturers
To: faculty@SU-SCORE.ARPA, su-bboards@SU-AI.ARPA, LEP@SU-AI.ARPA
It is again time to solicit applications for people in industry to teach a
course in the Computer Science Department. There will be three lecturers
for 1985-86 and each will teach a course for one quarter. An application
should include a curriculum vitae and a course description, suitable for
inclusion in the 1985-86 Stanford catalog. The lecturers this year are
Clarence Ellis of Xerox, Joseph Halpern of IBM and Richard Waldinger of
SRI. Their courses are described in the current catalog. Applications
are due January 15 in order that lecturers can be selected in time for the
courses to be in the catalog. The course should be in a scientific
specialty of the lecturer, and areas of computer science in which the
regular CSD offerings can usefully be supplemented are especially welcome.
The chairman of the Industry Lecturer Committee is John McCarthy
and suggestions and applications should go to him.
∂20-Nov-84 1305 RWW jmc-lists
how did you make such a mailbox?
Richards
∂20-Nov-84 1334 RESTIVO@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Nov 84 13:34:18 PST
Date: Tue 20 Nov 84 13:33:56-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
[cwr] I've visited MIT and talked to Professors Brady, Davis, Hewitt
and Winston about what I'm intending to do. Also, Horace Smith
at the EECS graduate admissions office.
There seemed to be an interest level. I was encouraged to apply.
I met with Professor Jardetzky last week and he suggested I meet
with Professor Buchanan and talk to him about what I want to do.
I have an appointment with his office on 11.12. Apparently BB
is building an expert system for the sort of stuff I used to work
on.
I have an appointment with Professor Genesereth on 30.11 and will
ask for some recommendation forms to be filled out.
Is it still possible to talk to you about filling out some of these
forms? The deadline for Stanford is 1.1.85, MIT is 15.1.85
If its all the same to the world, I'd like to stay here.
-------
∂20-Nov-84 1447 SG My boss at NTT will visit Stanford
To: JMC
CC: SG
My boss at Musashino Electrical Communication Laboratory will visit Palo Alto
area in December.
1) I am happy if you will be available on December 6 morning, and we have a
minute for greeting.
2) Is there any brochure or pamphlet which describes the research activities
in the Computer Science Department?
---------------
Name of my boss: Dr.Noriyoshi Kuroyanagi
His title: Director of the Communication Principles Research Division
at Musashino Electrical Communication Laboratory, NTT
Schedule for Dr.Kuroyanagi
Dec.4 Tue: 10am arrive at San Francisco Airport (from LA)
pm visit NTT California Office, Los Altos
Dec.5 Wed: am visit Teknowledge Inc., Palo Alto
pm visit XEROX PARC (Palo Alto Research Center)
Dec.6 Thu am visit Stanford University, CSD and CSLI
pm visit Stanford University, Prof.J.Bresnan, Linguistics.
∂20-Nov-84 1505 RPG CS reports
John, there are several documents of mine that I would like to
make CS Reports. Only one of them is much of a problem, and that is
because of its size. Here is the list:
1. Deliberate Writing
this is based on my thesis stuff
2. The Evaluation and Performance of Lisp Systems
this is the Lisp timing report - about 500 pages (?)
3. Lisp on Vax: A Case Study
this goes with the timing report
4. Software Pipelining
Qlambda stuff
5. Geometric Control Structures
Qlambda stuff
I suppose that only the first of these cannot be DARPA-funded.
Shall I reserve numbers for these guys? All but the last 1 is essentially
ready to go in within 1 month.
-rpg-
∂20-Nov-84 1510 LIBRARY@SU-SCORE.ARPA SOCRATES: Update and request for user opinions
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Nov 84 15:09:50 PST
Date: Tue 20 Nov 84 14:58:48-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: SOCRATES: Update and request for user opinions
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA,
: ;
You might be interested in knowing that the Math/CS Library distributed 26%
of all the Socrates accounts given out by the various library units. We will
continue giving out accounts to those requesting them. I would appreciate
a message if you are planning to come over to fill out the forms. This way
I can be sure that I have enough forms on hand.
Those of you who have a Socrates account and have done some searching, I am
always interested in hearing any suggestions about the database or any
problems you are having. It is important to remember that Socrates DOES
NOT INCLUDE EVERYTHING IN THE LIBRARY CATALOG. It only goes back to 1972.
For Stanford alone it includes only about 20% of the titles in our collections.
In addition, depending on how Stanford Libraries catalog an item, you
may not be able to find a title in Socrates that we do have in the collection.
Your best bet is to think of Socrates as the first step, but if you do not
find something be sure to send us a message and let us verify whether or not
we do not have it and need to order.
The database is set up so that the last item added is the first item displayed
in a particular search. Therefore you may come up with a number of initial
hits which give you a number and tell you to go to the reference desk. This
items are the books I have ordered. If you really do need a book that is on
order, let me know immediately so that I can do two things: (1) up the
priority and make sure it has actually gone through the order procedure
(2) place your name on a notify list. This is also helpful to me as feedback
on what I am ordering. If you are only interested in the topic, continue
displaying your hits until your find one that is not something on order but
a title we actually have in the collection.
Currently the Socrates accounts that you have are only good for night and
weekend searching. There is some talk of making these accounts able to
search during the day also. This would be a significant improvement for
those who prefer to search the library catalogs in their offices. For
the computer science department, there will probably be a great deal of
interest in doing that when the entire technical reports file is also
available through Socrates. I have not heard any recent dates as to
when you will be able to go from your terminal to ITS without dialing
up, but it should be happening soon.
Someone asked me when the library would begin placing all their records
online. Retrospective conversion is a major project. There are some
retrospective projects going on now and others waiting to be approved.
Such projects are usually funded by special grants and are often
limited to specific subject areas and/or time periods. However I
believe the long range plans of the library is to attempt to do as
much retrospective conversion as time and money will permit.
Harry Llull
-------
∂20-Nov-84 1641 BARWISE@SU-CSLI.ARPA Next Tuesday's meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 20 Nov 84 16:37:18 PST
Date: Tue 20 Nov 84 16:34:19-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Next Tuesday's meeting
To: Initiators@SU-CSLI.ARPA
All,
Several people have asked what next Tuesday's meeting is about. I
wanted to have a chance to talk with Carl York first, so he would hear
about it from me, not by second hand. I have now done that, so will
spill the beans.
The original conception of CSLI, or at least the original conception
that many of us had and that I had when I agreed to direct it, was a
much more compact sort of thing than eventually emerged. Given the
new funding situation, we must make a decision about whether to
resurrect the original conception, or to try to maintain the grander
center. Maintaining the grand conception requires, among other
things, like solid intellectual foundations, the following:
1. finding millions per year in funds,
2. finding a permanent replacement for the space in the
trailers, at a minimum, and
3. finding a director who is willing to take on (1) and (2).
When it seemed that SDF was able to supply (1) and (2) I was willing
to direct this version of the Center, even though it was much more
than I had bargained for. Given the new circumstances, however, I
have decided that this will be my last year as director. I will
continue as a PI on the SL Award, and devote my CSLI energies to
leading it, to my own research, and to working with the new director.
The Executive Committee has been thinking about my replacement, and
various facts have emerged. Clearly no one wants to be the person
that makes the grand conception unrealizable. However, is there
anyone who will dedicate themselves to realizing it? Certainly not
unless there is a real consensus behind it on the part of people from
all three branches of CSLI (CSLI/SU, CSLI/SRI and CSLI/PARC), one that
will translate into people spending a LOT of time and effort in
raising money. Whether there can be such a consensus is the real
issue before us. Unless there is such a consensus, the default seems
to be something like the original conception.
The main question before us, then, on Tuesday, is the nature of each
person's commitment to keeping the grand conception alive. I have
asked the member of the Executive Committee to each give you their
thoughts on this choice. You are all encouraged to express your own,
as well. John Perry and I will be meeting with the new Provost,
Rosse, on Monday, to see what kind of support we can hope for from
Stanford.
Since it is hard to separate this from the question of the director,
let me add a few other points on that issue. Formally, the Executive
Committee and I will make a recommendation to Pat Suppes, as Director
of IMSSS, who will then make a recommendation to Lieberman, the
relevant Vice Provost. It appears that it is almost unthinkable to
Lieberman that it should not be a tenured Stanford faculty member. We
could try to change his mind, but it would be difficult, at best. In
the second place, it is always difficult to get a new tenured position
through the university, since it is a permanent financial commitment.
If there is any thought that you are in fact hiring someone to be
"just" the director, it would never go through the university. So,
unless we fight very hard, it seems that the director will need to be
a tenured Stanford faculty member. That obviously narrows the choice
considerably.
See you Tuesday.
Jon
-------
∂20-Nov-84 1647 100 (on TTY72, at TV-137) incompletion of cs206 course
Dr. McCarthy,
I have been advised to undergo surgery on Tuesday. It is probable
that I will be unable to attend class for the remainder of the quarter,
and I have been informed that I could not obtain the videotapes of the
class for home (bed) viewing, by Judy Lemon. They can hold copies of the
tapes until after the class, and then I could view them in the library
after about 3 months. To do this would require that I receive an incomplete
for the course and then complete it during winter and spring quarter.
I do not need this course as an academic requirement, but rather
to meet the tuition requirement and my advisor, Dr. Williamson has recommended
that I ask if you would be willing to allow me to take an incomplete for the
course and finish it later. I will not know if this is actually necessary
until Thursday of next week, but it is expected to be a greater than even
chance.
For further details please call me at 941-5144 or rmeier@star.
Thank you,
Bob Meier
∂20-Nov-84 1711 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 20 Nov 84 17:10:48 PST
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Tue 20 Nov 84 17:07:57-PST
Date: 20 Nov 84 1701 PST
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
To: "@DIS.DIS[1,CLT]"@SU-AI.ARPA
Speaker: Paolo Mancosu, Stanford Philosophy Department
Title: Non-Standard Models of Arithmetic and Indicator Theory
Place: Room 381-T, 1st floor Math. Corner, Stanford University
Time: Monday November 26, 4:15-5:30 p.m.
S. Feferman
∂20-Nov-84 1718 BARWISE@SU-CSLI.ARPA Original conception
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 20 Nov 84 17:18:05 PST
Date: Tue 20 Nov 84 17:16:16-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Original conception
To: JMC@SU-AI.ARPA
The original conception was a center that would cost less than
2,000,000 per year. This year we are spending 5,500,000.
-------
∂20-Nov-84 2213 RTC Common Lisp
Hedrick is asking who wants to be on the common lisp mailing list.
Do you want to be? Do you know anyone else who might.
Ross
∂21-Nov-84 0646 RA
I will come in late today. Will be in the office by 1:00.
∂21-Nov-84 0838 ullman@diablo Industrial Lecturers
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 21 Nov 84 08:38:24 PST
Date: Wed, 21 Nov 84 08:39:25 pst
From: Jeff Ullman <ullman@diablo>
Subject: Industrial Lecturers
To: jmc@sail
I have had some discussions with Greg Nelson about teaching either
CS143 or CS157A. Zohar seems happy to have him teach 157A and has
(apparently) been in contact with Nelson about it.
I'm sure we could use him for 143 as well.
∂21-Nov-84 1157 ullman@diablo re: Industrial Lecturers
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 21 Nov 84 11:57:41 PST
Date: Wed, 21 Nov 84 11:58:40 pst
From: Jeff Ullman <ullman@diablo>
Subject: re: Industrial Lecturers
To: JMC@Sail
Nelson is at DEC CIRC.
∂21-Nov-84 1246 RA
Louis M. Lerman
Louis came by to see you. He wants to invite you to a small faculty
get together w/him for an informal discussion of a thesis. No obligation
suggested on your part. Will talk to you next week. He brought with him
one page which includes one of the more developed chapters. I put it on your
desk.
I hope you feel better.
∂21-Nov-84 1333 WIEDERHOLD@SRI-AI.ARPA Kling
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 21 Nov 84 13:33:10 PST
Date: Wed 21 Nov 84 13:33:06-PST
From: Gio <Wiederhold@SRI-AI.ARPA>
Subject: Kling
To: jmc@SU-AI.ARPA
cc: wiederhold@SUMEX-AIM.ARPA
I am inviting Rob Kling to a CS colloquium in the Winter quarter. I hope
you will be able to come and discuss the issue.
Gio
-------
∂21-Nov-84 1449 RA
Which paper do you want to send to Reinfrank, is this the circumscription paper?
∂21-Nov-84 1456 RA
Please call Chris Goad @ 493 0145 today.
∂21-Nov-84 1700 RINDFLEISCH@SUMEX-AIM.ARPA Symbolics 3600 Access
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 21 Nov 84 17:00:07 PST
Date: Wed 21 Nov 84 17:00:55-PST
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: Symbolics 3600 Access
To: JMC@SU-AI.ARPA
cc: Rindfleisch@SUMEX-AIM.ARPA, Feigenbaum@SUMEX-AIM.ARPA
John, we are in a temporary bind w/r to having enough Symbolics 3600's for our
work and this is to ask about interim access to your machines. As you know,
HPP has not been able to move entirely to Welch Road because the landlord
hasn't been able to come up with all the space we need. Mike Genesereth's
group is directly affected in that he and his students have remained behind in
MJH. The problem is that we now have 4 3600's, all at WR and getting heavy use
by Rosenbloom, the Adv Architectures project, and Genesereth. We have 4 more
machines coming as part of the Architectures project but they probably won't be
here until Feb or March. Mike's use of the existing machines is badly hampered
by geographical distance and competition from the other groups. But we don't
have enough machines to move more than 1 back to MJH, without hurting the other
groups. I think Mike has been using your machines already to try to solve this
problem but without any formal agreement with you.
So we have the following questions:
1) How much time is available on your 2 machines that Mike might use until our
additional machines come?
2) If a substantial amount, how can we arrange with you for Mike to use it?
Thanks, Tom R.
-------
∂21-Nov-84 2159 pratt@Navajo Prof. Smith from China
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 21 Nov 84 21:59:33 PST
From: Vaughan Pratt <pratt@Navajo>
Date: 21 Nov 1984 2158-PST (Wednesday)
To: jmc@su-ai
Cc:
Subject: Prof. Smith from China
I think the gist of the following is that I mistook the identity of the
gentleman whose coming was inaccurately forecast by David Gries. Wu Wen-tsun
is the one with the nice decision method.
-v
------- Forwarded Message
Return-Path: <ATP.CHOU@UTEXAS-20.ARPA>
Received: from UTEXAS-20.ARPA by Navajo.ARPA with TCP; Wed, 21 Nov 84 12:16:26 pst
Date: Wed 21 Nov 84 00:07:48-CST
From: Shang-Ching Chou <ATP.CHOU@UTEXAS-20.ARPA>
Subject: Another Professor Wu
To: Pratt@SU-NAVAJO.ARPA
Thank you for your information about Wu's not coming.
"Wu" is one of the biggest family names in China. Professor Wu Yunzeng is
a logician from Peking University. I know him in person. Professor Wu
wen-tsun is a topologist from Academy of Sciences of China who is now
working on mechanical theorem proving in various geometries.
The experiment with your conjecture tells me some thing:
(1) The representation of polynomials in MACSYMA (in CRE form) is very
compact and saving space.
(2) The operations on polynomials seem to produce a large amount of
cons which may can be collected and reused before the operations are
finished. I don't know how much I can save in this way. I will try the
general case for n = 4 during Thanksgiving.
Thanks.
-------
------- End of Forwarded Message
∂22-Nov-84 1929 pratt@Navajo Seeing Ethiopia on a Marxist Diet
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 22 Nov 84 19:29:44 PST
Date: Thu, 22 Nov 84 19:28:28 pst
From: Vaughan Pratt <pratt@Navajo>
Subject: Seeing Ethiopia on a Marxist Diet
To: jmc@sail
Right on.
∂23-Nov-84 1254 NILSSON@SU-SCORE.ARPA Books and Publishers
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 Nov 84 12:54:50 PST
Date: Fri 23 Nov 84 12:53:31-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Books and Publishers
To: jmc@SU-SCORE.ARPA
cc: nilsson@SU-SCORE.ARPA
John, I remember talking with you a while back about your
proposed books on LISP and on your AI and Philosophy papers.
Running a publishing company would conflict with my newly acquired
main interest in life--Stanford. I've decided to transfer the Tioga
computer books to a new company just started by Bill Kaufmann and Mike
Morgan (a former A-W editor). The new company is called Morgan
Kaufmann Publishers, Inc. (I'm involved in the new company as a
co-founder and as an editorial consultant--but my time commitments to
it are quite limited.) In any case, the new company is more "real"
than I had time to make Tioga.
Mike Morgan would like to know if you are still uncommitted about a
publisher for your books. If so, and if you are interested in
talking to him, he would call you. -Nils
-------
∂24-Nov-84 1056 golub@Navajo supercomputing
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 24 Nov 84 10:56:42 PST
From: Gene Golub <golub@Navajo>
Date: 24 Nov 1984 1055-PST (Saturday)
To: jmc@sail, rindfleisch@sumex, nilsson@sri-ai, zm@sail
Cc: golub@Navajo, s.street@lots-a
Subject: supercomputing
I attach a message from Bob Street. Stanford is joining a consortium
organized by GA ( formerly General Atomics) which is proposing to NSF a
center which will have available a Cray XMP-4. The center will be
housed in San Diego. Let Bob know if you have an interest.
-GENE
------- Forwarded Message
Return-Path: <S.STREET@LOTS-A>
Received: from LOTS-A by Navajo with PUP; Sat, 24 Nov 84 00:20 PST
Date: Sat 24 Nov 84 00:22:40-PST
From: Robert Street <S.STREET@LOTS-A>
Subject: AI interest in the supercomputer initiative
To: golub@Navajo
Cc: s.street@LOTS-A
Dear Gene:
The GA Technologies people who are the potential operators of the San Diego
Supercomputer Center are interested to know if we have any AI folk here who
are potential users and what their needs would be, e.g., Prolog on the Cray,
interfaces, graphics, etc. Can you suggest any contacts or ideas on the
subject. If there is much interest, one or more of the GAT folk would like
to come and visit to talk over plans and needs. They seem to think that they
are going to win!
Cheers,
Bob*
-------
------- End of Forwarded Message
∂25-Nov-84 0025 FOGELSONG@SU-SCORE.ARPA JMM's and your remarks on attaining the "Correct" view of Ethiopia
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 25 Nov 84 00:25:33 PST
Date: Sun 25 Nov 84 00:24:18-PST
From: David Fogelsong <FOGELSONG@SU-SCORE.ARPA>
Subject: JMM's and your remarks on attaining the "Correct" view of Ethiopia
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 24 Nov 84 23:45:00-PST
I greatly suspect that one cannot form, even in principle, a
"correct" interpretation of either the Ethiopian situation, or any
complex, political system. It seems that one could always construct
numerous, if not infinitely many, models of the domain which one is
trying to describe. Moreover, it's not clear that those models need
be isomorphic. One could have radically different interpretations as
to why a certain phenomena is so, with each interpretation making
perfect sense within its own framework. Thus, even if I were to audit
classes given by the Food Research Institute and the like, I would
merely come to view the world through the framework of rationale which
those classes provide. There's no guarantee, however, that the Food
Research Institute model is in any sense the "right" model, even if it
is consistent with all the known facts, for one could no doubt
construct a model which is equally consistent with the known facts and
which attributes the same events to different causes. And if
something crops up which would seem to negate one's chosen model, one
could always save it by adopting ad hoc assumptions. I see no way of
choosing the "right model" with certainty, even if I went to great
lengths to research the pertinent facts.
Of course, no normal human being has time to "research the
pertinent facts" on any but a small subset of issues anyways.
In brief, I think that as human beings we find ourselves in
a rather hopeless situation when trying to find out the "true nature
of the world."
--David
-------
∂25-Nov-84 1137 GARDNER@SUMEX-AIM.ARPA Meeting Monday?
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 25 Nov 84 11:37:32 PST
Date: Sun 25 Nov 84 11:38:01-PST
From: Anne Gardner <GARDNER@SUMEX-AIM.ARPA>
Subject: Meeting Monday?
To: stan@SRI-AI.ARPA
cc: jmc@SU-AI.ARPA
I think we tentatively set a meeting time for Monday at 4:30. But I
saw McCarthy on Wednesday, and he didn't know about it. Did that time
not work out on your end?
--Anne
-------
∂25-Nov-84 1419 JMM Discussion on bboard
While I have stated my arguments in a message on the bboard, I
would welcome a chance to discuss some of these and related issues
with you in person. Perhps there can be more give-and-take, a more
fruitful discussion in such a setting.
Jitendra
∂25-Nov-84 1613 RESTIVO@SU-SCORE.ARPA Re: capitalist hearts
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 25 Nov 84 16:13:17 PST
Date: Sun 25 Nov 84 16:11:34-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
Subject: Re: capitalist hearts
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 25 Nov 84 15:15:00-PST
I say the socialists will be all cut up over the example.
-------
∂26-Nov-84 0929 STAN@SRI-AI.ARPA Anne Gardner
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 26 Nov 84 09:29:05 PST
Date: Mon 26 Nov 84 09:29:14-PST
From: STAN@SRI-AI.ARPA
Subject: Anne Gardner
To: jmc@SU-AI.ARPA
cc: stan@SRI-AI.ARPA
John, I tentatively arranged to talk to Anne this afternoon at 4:30
about her CBCL interests, and we thought you might want to be
involved. Actually, I'd like to talk to you about it privately first.
Are you going to be in this morning? --Stan
-------
∂26-Nov-84 1004 RA dentist
yes, you do have dental coverage. You are covered by California Dental
Service, Group # 3365. Your dentist should have a claim form. Just in case
he doesn't, the benefit office is mailing you one.
∂26-Nov-84 1015 LIBRARY@SU-SCORE.ARPA Ethiopia, McCarthy, and SOCRATES
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Nov 84 10:15:05 PST
Date: Mon 26 Nov 84 09:59:43-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Ethiopia, McCarthy, and SOCRATES
To: su-bboards@SU-SCORE.ARPA
cc: : ;
It looks as if Prof. McCarthy is making good use of SOCRATES for bibliographic
information. Any flamers need their own SOCRATES accounts?
(Just couldn't resist this plug for the library online catalog,ie McCarthy's
message with bibliography showing library locations)
HL
-------
∂26-Nov-84 1044 RA nonmonotonic biliography
1.Where do I find the nonmonotonic conference bibliography?
2. Do you want me to add papers so far unlisted to nonmon(1,jmc]
3. Re perlis@maryland, do I send mail to this address and ask for the bibliog.?
∂26-Nov-84 1050 RA Veronica Dahl's talk
In order to process her honorarium I need to know what kind of talk she
gave, was it university related, or did it have to do with your research, if
yes, which one. Do you know how much we pay?
∂26-Nov-84 1104 OHLANDER@USC-ISI.ARPA Program Summary
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 26 Nov 84 11:04:34 PST
Date: 26 Nov 1984 14:03-EST
Sender: OHLANDER@USC-ISI.ARPA
Subject: Program Summary
From: OHLANDER@USC-ISI.ARPA
To: JMC@SU-AI.ARPA
Message-ID: <[USC-ISI.ARPA]26-Nov-84 14:03:56.OHLANDER>
John,
Several months ago we sent out requests for summaries of
research that would be included in a DARPA compendium of ongoing
work in AI. Did you receive this request? If not, I will send
you a copy of the format that we need. If you did, when can we
expect your response?
On a separate matter, I talked to you in August to see if there
was some way that Stanford could get the money provided for
Common Lisp to Dick Gabriel for the blue pages and some other
work that he would continue. Have you reached any resolution on
this? Perhaps you could pay him as a consultant.
On yet another matter, I received a call from you last month
about some concern that you had regarding the parallel Lisp work
that you had discussed with us at an earlier date. I returned
your call but I have not heard from you. Did your problem go
away?
Ron Ohlander
∂26-Nov-84 1350 RA John Nafeh
Could you meet John Nafeh from MAD next week for 2-4 hours?
He can make it any day except Monday and Thursday. Please let me know.
∂26-Nov-84 1530 GLB midterm
The midterm papers are graded. I gave them to Ross.
∂26-Nov-84 1620 RPG Synapse
To: JMC@SU-AI.ARPA, cheriton@SU-PESCADERO.ARPA, JJW@SU-AI.ARPA
Synpase will be visiting us tomorrow at 3pm, starting at my office
and moving somewhere. JMC: this is a reminder to you; David: I hope
this is a reminder to you; and Joe: this is a request for you.
-rpg-
∂26-Nov-84 1658 RA
I left the invoice to MAD on your desk to be signed.
∂26-Nov-84 1805 AAAI-OFFICE@SUMEX-AIM.ARPA [Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>: Artificial Intelligence Movie]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 26 Nov 84 18:04:51 PST
Date: Mon 26 Nov 84 17:54:13-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: [Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>: Artificial Intelligence Movie]
To: Amarel@RUTGERS.ARPA, Bledsoe@UTEXAS-20.ARPA, Buchanan@SUMEX-AIM.ARPA,
Brachman@SRI-KL.ARPA, KRD%MIT-OZ@MIT-XX.ARPA, Engelmore@SUMEX-AIM.ARPA,
Lerman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA,
JMC@SU-AI.ARPA, Nilsson@SRI-AI.ARPA, Reddy@CMU-CS-A.ARPA,
Rich%MIT-OZ@MIT-XX.ARPA, Stan@SRI-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA,
Stefik@XEROX.ARPA, Tenenbaum@SRI-KL.ARPA, Walker@SRI-AI.ARPA,
Webber%upenn@UDEL-RELAY.ARPA, PHW@MIT-MC.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
The AAAI has been asked to help support a film about knowledge-based
systems being produced by the Heuristic Programming Project and
Stanford's Dept of Communications. We'd like your comments on
their request before we go forth with any decision. We've identified
some basic qualification requirements for support of this nature
which follow:
* Educational institution - requesting the funding
* Allocate a maximum of $5,000 or 10% of the cost of the
project, but not to exceed $5,000
* Not to be used for commercial purposes
* Must identify the AAAI in the credits
* Provide the AAAI with a copy of the film
Below is a msg describing the content of the film.
I look forward to hearing your comments on this matter.
Regards,
Claudia
---------------
Mail-From: EENGELMORE created at 25-Sep-84 16:32:48
Date: Tue 25 Sep 84 16:32:46-PDT
From: Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>
Subject: Artificial Intelligence Movie
To: AAAI-office@SUMEX-AIM.ARPA
cc: EENGELMORE@SUMEX-AIM.ARPA
Claudia, this (extended) message is to give you more detailed
information concerning our plans for a film about Heuristic
Programming Project research in artificial intelligence. This film is
not intended to document the full 20-year history of AI work by our
laboratory but rather to illustrate the current state of
knowledge-based system research, the transfer of this technology into
diverse applications in industry and government, and the significant
research issues that have to be addressed for the 1980's and 90's. To
show you more concretely what we have in mind, I am sending a
brief description of the film and biographical sketches of the
principals involved.
Our own motivation in producing such a film stems from an exceptional
opportunity to work with Professor Blaustein in the Stanford Communications
Department and our need to find a more effective way to respond to the many
information and visitor requests we receive each month to find out about
artificial intelligence research and the work of the HPP. Professor
Blaustein's long experience as a Hollywood producer and the quality of his
students assure a very high quality product. For this reason, we plan to use
film rather than video tape, even though the cost is higher.
We estimate the lowest achievable direct cost of a 30-minute film to be
approximately $50,000 including $1,300 for preproduction costs, $13,000 for
production costs, and $36,000 for postproduction costs. This includes a
staffing level and production effort to meet a deadline of approximately
February 1, 1985 for completion. The estimate is based on using lots of
student labor and getting very advantageous salary rates for needed
professional time. We have been able to persuade a number of recent Stanford
Communications graduates (see the biographical sketches below) to
essentially donate some of their time to the university at graduate student
rates for this effort.
The US Information Agency has committed $26,000 to the HPP so that
they might use this film at the 1985 World's Fair in Tsukuba, Japan.
In order to meet their urgent deadline for completion, we must secure
additional funding to ensure that this important perspective about
artificial intelligence is presented in an effective way through this
exceptional film.
Claudia, I believe that the existence of this film will be of obvious
value to the AAAI and that support by the AAAI would be appropriate.
I am sending you portions of the package we put together for the USIA
in July. Since then, there have been revisions to the plan. . .most
notably, the Tricero section has been replaced by information about
the new Nuclear Magnetic Resonance work being done by Bruce Buchanan
with Oleg Jardetsky (et al.), and Michael Genesereth's participation is
being expanded.
Bruce Buchanan will be meeting with Annie Feibelman within the next
week to approve or amend her up-dated shooting schedule. As soon as
we have an up-dated version, I will send a copy to you.
Following are a series of files in scribe format (I will send you hard
copy by the end of this week).
-------------------------------------------------------------------------------
MOVIE-SUMMARY
@device[dover]
@Style(Indent 0, Spacing 1.0 lines, Spread 0.5 lines, WidowAction = Force,
Date = "March 8, 1952")
@>@Value(Date)
@Begin(SubHeading, Centered)
HPP Film Summary
@End(SubHeading)
The purpose of this film is to illustrate the current state-of-the-art
of Heuristic Programming Project research in artificial intelligence,
the structure of modern knowledge-based AI systems and the process by
which they are built, the transfer of this technology into diverse
applications (e.g., medicine, engineering, military defense), and the
significant research issues to be addressed for the 1980's and 90's.
In order to explain these issues, the film will have leading experts in the
field showing their work and discussing how it fits into the overall
picture. All of the experts listed in the attached script outline have
agreed to participate actively in the production of the film. Three
applications are explored, in the fields of medicine (see sequence V of
the script, the ONCOCIN system for treatment of cancer patients),
engineering (sequence VIII, KBVLSI system for designing integrated circuits
and systems), and military defense (sequence VII, the TRICERO system for
interpreting tactical aircraft deployment). In each sequence, the person
who created the system explains what it does, how it functions, and where
AI is going in that particular field. In addition, for ONCOCIN, a physician
comments on the program's effectiveness in the "real world" (sequence IV).
@SubHeading[Film Synopsis:]
After a short introduction, the basic questions addressed and methodologies
used in HPP AI research are discussed by Ed Feigenbaum. The intellectual,
physical, and computational environment provided by the research laboratory
is then introduced. This sequence (III) provides a context for the examples
of AI which follow.
Next - a concrete example of an AI system in action: ONCOCIN (sequences
IV & V).
Then Penny Nii gives the basic structure of an AI system: what are its
parts and how do they function (sequence VI)? Her explanation is
illustrated by an animated graph - clear and concise graphics.
Penny also talks about knowledge engineering (the art of translating
heuristic and factual knowledge of an expert into computer language and
structure) and software aids such as the AGE system, which help the
knowledge engineer in programming.
Next - more concrete examples of AI systems TRICERO (sequence VII)
and KBVLSI (sequence VIII) are discussed by Harold Brown. This leads into
a discussion of future computing architectures for AI computing constructed
with the aid of knowledge-based design tools.
Last - Bruce Buchanan discusses the transfer of AI technology to industry
and the key questions and future thrust of AI research.
------------------------------------------------------------------------------
MOVIE-MAKERS
@device(dover)
@style[indent 0]
@Define(Dscr1=Description, LeftMargin +1.25 inches, Indent -1.0 inches,
Spacing 0.9 lines, Spread 0.5 lines)
@Define(Dscr2=Description, LeftMargin +1.875 inches, Indent -0.625 inches,
Spacing 0.9 lines, Spread 0.2 lines)
@heading[Film Makers]
@blankspace[.33 in]
@b[Director:] Anne Feibelman
@Begin(Dscr1)
1983 - present@\Stanford University, Department of Communications,
Masters' Student - Documentary Film Production Program
1979-83@\Israel Educational Television
@\Department of Acquisitions for purchase and translation of foreign
films. Tel Aviv, Israel
@End(Dscr1)
@b[Cinematographer:] Donald Sellers
@Begin(Dscr1)
1984@\National PBS @b[Frontline] series: Cinematographer and editor of
@i[The Other Side of the Track]
1983@\National PBS @b[Frontline] series: @i[Looking for Mao]
1982@\Cinematographer: @i[Moonchild,] docudrama
@End(Dscr1)
@begin<Dscr2>
@b[Prizes:]@\Best Feature, National Educational Film Festival.
@\Top Honors: Cine Golden Eagle
@end<Dscr2>
@b[Sound Recordist:] Marilyn Waterman
@Begin(Dscr1)
1980@\Sound Recordist for documentary: @i[Bounty Expedition,] Royal
Geographic Society
1983@\Filmmaker: @i[Rodin's Balzac,] Art documentary
@End(Dscr1)
@begin<Dscr2>
@b[Prizes:]@\Academy of Motion Pictures Arts and Sciences, Academy
Award for Documentary
@\Chicago International Film Festival: Gold Plaque
@\Palo Alto Film Festival: Top Honors
@\National Educational Film Festival: Honorable Mention
@\American Film Festival: Finalist
@end<Dscr2>
@b[Faculty Advisor:] Julian Blaustein
@Begin(Dscr1)
@\Professor of Communication at Stanford University
@\Former Film Producer (@i[Broken Arrow;] @i[Bell, Book and Candle;]
@i[The Day the Earth Stood Still;] @i[Khartoum;] et cetera)
@End(Dscr1)
----------------------------------------------------------------------------
TECHNICAL PEOPLE DIRECTLY INVOLVED IN MOVIE
@device[dover]
@make (text)
@style[indent 0]
@heading[Individuals appearing in HPP movie]
@blankspace[5 lines]
@begin<center>
@b[Dr.Harold Brown]
@b[Senior Research Associate]
@end<center>
@blankspace[1 line]
Harold Brown is a Senior Research Associate in the Heuristic
Programming Project at Stanford University. His formal training is in
mathematics, culminating in a PhD from Ohio State University in 1966.
He joined the HPP DENDRAL project in 1971 and has been engaged in the
design of many knowledge-based systems and in the analysis of their
structures. He did a formal analysis of the chemical structure
generator subsystems in DENDRAL and has investigated applications of
many paradigms for knowledge representation and problem solving in
expert systems. He worked from 1977-1979 at the NASA Ames Research
Center as a Senior Project Scientist and returned to Stanford in 1979
to head up the Knowledge-based VLSI design project which has resulted
in the Palladio system.
He has also consulted in the design and implementation of several complex
expert systems for ESL, a local defense contractor. These involve problems of
fusing diverse sources of knowledge to produce a coherent model of complex
situations. Using the AGE blackboard system, he designed the prototype
Hannibal system which determines the ground configuration and organization
of enemy units by reasoning from preprocessed COMINT data. Hannibal uses
knowledge about transmitter characteristics, message types and contents,
communication protocols and organizational hierarchies to infer information
about the enemy's ground communication networks and the nodes on the
networks. The evolving battlefield configuration is presented on a dynamic,
graphics situation board.
Another prototype system, Tricero, deals with airborne platforms. Its
purpose is to analyze in real-time situations similar to the Korean 707
incident using both COMINT and ELINT data. Tricero consists of three
autonomous blackboard systems: one for ELINT analysis, one for COMINT
analysis, and one to correlate the results of the ELINT and COMINT
analyses. The three blackboards cooperate via reports and tasking requests.
The outputs of Tricero are a dynamic, graphics situation board representing
the results of ELINT and COMINT analysis fusion, threat indications as
they are recognized, and data collection tasking requests. The system
contains over sixty independent expert knowledge sources.
@newpage
@begin (center)
@b[Bruce G. Buchanan]
@b[Professor of Computer Science Research]
@end (center)
@blankspace (1 line)
Bruce G. Buchanan, Professor of Computer Science Research at Stanford
University, received his B.A. in Mathematics from Ohio Wesleyan
University in 1961, and his M.A. and Ph.D. from the Dept. of
Philosophy at Michigan State University in 1966. He was Instructor of
Philosophy at Michigan State University and then, in 1966, joined
Stanford as a Research Associate in Computer Science. From 1971 to
1976 he was a Research Computer Scientist, while holding a National
Institutes of Health Career Development Award. In 1976 he was
appointed to his present position.
Prof. Buchanan's main line of research is in the class of artificial
intelligence programs known as expert systems. He is co-principal
investigator of the Heuristic Programming Project at Stanford,
founding board member and membership chairman of the American
Association for Artificial Intelligence, and member of several
editorial boards. He is co-author (with R.Lindsay, E.A.Feigenbaum and
J.Lederberg) of @i[Applications of Artificial Intelligence for Organic
Chemistry: The DENDRAL Project] and (with E. H. Shortliffe) of
@i[Rule-based Expert Systems.] He has published numerous papers and
review articles in a wide variety of books and journals, including
@i[Artificial Intelligence], @i[The Journal of the American Chemical
Society], @i<Organic Mass Spectrometry>, @i[The Stanford Law Review],
@i[The British Journal for the Philosophy of Science], @i[The Journal
of the American Medical Association], @i[Computers and Biomedical
Research], @i[Computing Reviews], and @i[Proceedings of the IEEE].
@blankspace[5 lines]
@begin[center]
@b[Edward A. Feigenbaum]
@b[Professor of Computer Science]
@end[center]
@blankspace[1 line]
Professor Feigenbaum is Professor of Computer Science at the Computer
Science Department at Stanford University. He is Senior Principal Investigator
of the Heuristic Programming Project at Stanford, one of the world's leading
laboratories for work in Knowledge Engineering and Expert Systems. His
work on the DENDRAL program, beginning in 1965, initiated these fields
of applied artificial intelligence. Dr. Feigenbaum also heads the
national computer resource for applications of Artificial Intelligence
to Medicine and Biology known as the SUMEX-AIM facility, established by
NIH at Stanford University.
He has been Chairman of the Computer Science Department and Director
of the Computer Center at Stanford University. He is the Past
President of the American Association for Artificial Intelligence. He
has served on the National Science Foundation Computer Science
Advisory Board, and many other governmental committees concerned with
Computer Science.
He is the co-editor of the recent encyclopedia, @i[The Handbook of
Artificial Intelligence], and of the famous early book, @i[Computers
and Thought], published by McGraw-Hill. He is co-author of the
McGraw-Hill book, @i[Applications of Artificial Intelligence in
Organic Chemistry: The DENDRAL Program] and was the founding editor of
the McGraw-Hill Computer Science Series. His most recent publication
(co-authored with Pamela McCorduck) is the book @i[The Fifth
Generation: Artificial Intelligence and Japan's Computer Challenge
to the World], published by Addison-Wesley, May 1983.
He received his B.S. from Carnegie-Mellon University in 1956 and his
Ph.D. from the same school in 1959.
@blankspace[4 lines]
@begin<center>
@b[Charlotte DeCroes Jacobs]
@b[Assistant Professor, Department of Medicine]
@end<center>
@blankspace[1 line]
Charlotte DeCroes Jacobs, born Oakridge, Tennessee, January 1946.
B.A. magna cum laude, University of Rochester in Biology; M.D., 1972,
Washington University School of Medicine, St. Louis, Missouri. Member
Phi Beta Kappa, Alpha Omega Alpha, American Society of Clinical
Oncologists. Currently Assistant Professor, Division of Oncology,
Department of Medicine, Stanford University, and Director, Oncology
Day Care Center.
Dr. Jacobs is Co-Principal Investigator of the ONCOCIN project, a
system to provide consultations and data management in the area of
cancer chemotherapy. She is interested in developing a clinical
oncology tool that will help improve patient care, data collection,
and the teaching of post-doctoral fellows. The acceptance of computer
systems by physicians is of particular interest, as is the design of
formal experiments to assess the clinical impact of new computational
tools. @blankspace[4 lines]
@begin<center>
@b[H. Penny Nii]
@b[Research Associate]
@end<center>
@blankspace[1 line]
H. Penny Nii is a Research Associate in the Heuristic Programming Project
at Stanford University. She received her Masters degree in Computer Science
from Stanford University in 1972. She has designed, built, and experimented
with a variety of expert systems and knowledge engineering tools for over
ten years. She has been a member of the research staff of the Heuristic
Programming Project since 1976. Between 1973 and 1975 she was the Associate
Investigator for the HASP Project at Systems Control Technology. HASP
(since then known as the HASP/SIAP program) is one of the very early expert
systems, a successor to DENDRAL and a contemporary to MYCIN. HASP's problem
domain is ocean surveillance. The program builds and maintains a situation
board by interpreting and fusing passively acquired sonar signals from
multiple hydrophone arrays and other intelligence information.
Based on her experiences with HASP and CRYSALIS (a program to infer the
three-dimensional model of protein molecules by interpreting data derived
from X-ray diffraction data), she designed and built the AGE knowledge
engineering tool. AGE is a tool for building applications that use the
Blackboard framework of problem solving. The Blackboard programming
framework is well suited to tasks involving data analysis and information
fusion -- problems that require opportunistic strategies using many sources
of data and knowledge that are often incomplete and errorful. In addition
to the two applications being developed at ESL (see Harold Brown's
background statement), AGE has been distributed and used by other
research groups including many university and industrial laboratories.
Currently she is doing research on concurrent problem solving methods
involving modifications to and extensions of the Blackboard framework. The
goal of the research is to be able to solve a class of problems similar to
HASP, including image processing, concurrently.
@blankspace[4 lines]
@begin<center>
@b[Thomas C. Rindfleisch]
@b[Director, Heuristic Programming Project]
@end<center>
@blankspace[1 line]
Thomas Rindfleisch, a Senior Research Associate, is Director of the
Heuristic Programming Project. He received his masters degree in
theoretical physics from Caltech in 1965. He is responsible for the
overall management and joint technical direction of the HPP which
comprises 70 faculty, staff, and students working on basic research
and applications of knowledge-based systems. His personal research
focuses on advanced system architectures for symbolic computation and
knowledge-based system applications.
From 1973 to 1982 Thomas Rindfleisch was Director of the SUMEX
Computer Resource. SUMEX is an NIH-funded, national computing
resource for artificial intelligence applications in biomedicine. He
was responsible for technical direction of the development of a
complex computing resource for AI research, coordination of a national
community of 20 user projects, and administration of the local core
project.
Previously, Mr. Rindfleisch was responsible for the technical
direction and management of a group developing intelligent data
systems for low and high resolution gas chromatography/mass
spectrometry systems in the Stanford Departments of Genetics and
Chemistry and of a group developing some of the earliest systems for
digital image processing at the Caltech Jet Propulsion Laboratory for
unmanned NASA space missions and other applications. He has authored
many technical publications describing his research work.
@blankspace[4 lines]
@begin (center)
@b(Edward H. Shortliffe)
@b(Assistant Professor of Medicine and Computer Science)
@b(Stanford University)
@end(center)
@blankspace(1 line)
Edward H. Shortliffe is Assistant Professor of Medicine and Computer
Science at Stanford University. He received an A.B. in Applied
Mathematics from Harvard College in 1970, a Stanford Ph.D. in Medical
Information Sciences in 1975, and an M.D. at Stanford in 1976. During the
early-1970's, he was principal developer of the expert system known as
MYCIN. After a pause for medical house staff training between 1976 and 1979,
he returned to join the Stanford faculty where he has directed an active
research program in medical expert systems development. His interests
include the broad range of issues related to expert systems and their
effective implementation. Of particular concern are models for evidential
reasoning and representation techniques to support advanced explanation
capabilities. He has spearheaded the formation of a new Stanford degree
program in medical computer science and continues to divide his time between
clinical medicine and computer science research.
Dr. Shortliffe sits on the editorial boards of several medical computing
and artificial intelligence publications. He has served on the Biomedical
Library Review Committee of the National Library of Medicine and is recipient
of a research career development award from that agency. In addition, he
received the Grace Murray Hopper Award of the Association for Computing
Machinery in 1976 and is a Henry J. Kaiser Family Foundation Faculty Scholar
in General Internal Medicine. Dr. Shortliffe has written over 70 articles
and books in the field of medical artificial intelligence. Volumes include
@i(Computer-Based Medical Consultations: MYCIN) (Elsevier/North Holland,
1976), @i(Readings in Medical Artificial Intelligence: the First Decade)
(with W.J. Clancey; Addison-Wesley, 1984), and @i(Rule-Based Expert Systems:
The MYCIN Experiments of the Stanford Heuristic Programming Project)
(with B.G. Buchanan; Addison-Wesley, 1984).
-------
-------
∂26-Nov-84 1808 SMC cars
Thanks, I was glad to get out of that place. That car may turn out to be
a good deal, but I think that unless the mechanic thinks it is an
absolute peach, that a good car can be found for alot less money.
Anyway, we'll see.
∂26-Nov-84 1941 HULLMAN@SU-SCORE.ARPA report
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Nov 84 19:41:14 PST
Date: Mon 26 Nov 84 19:39:08-PST
From: Holly Ullman <HULLMAN@SU-SCORE.ARPA>
Subject: report
To: faculty@SU-SCORE.ARPA
In the annual report to the dean's office, Gene wants to include
a special section highlighting several topics on which we have
information. Currently, they are HPP, the TeX system, the
DEC Lab and the CLaSSiC committee. If you are engaged in a project
or group that you think should be included, please send me a short
description - within the next week at the outside, as my deadline
is approaching.
-------
∂26-Nov-84 1950 HULLMAN@SU-SCORE.ARPA AI info for annual report
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Nov 84 19:50:19 PST
Date: Mon 26 Nov 84 19:47:57-PST
From: Holly Ullman <HULLMAN@SU-SCORE.ARPA>
Subject: AI info for annual report
To: jmc@SU-AI.ARPA
Gene is anxious to highlight artificial intelligence in the annual
report. Tom Rindfleisch will give me an article on HPP but we feel
we should also have one on expert systems, as we're not happy about
presenting only part of the picture. Gene suggested that I contact
you. Would it be a lot of trouble to write a short article (a few
paragraphs) on what is most current and interesting in the are?
An outline would be okay. I can rewrite it and pass it back for
your approval.
-------
∂26-Nov-84 2138 SMC
I have the following overfull hbox problems, which will require
either rewording, or breaking of non-display equations.
concep.tex[1,smc]/6p/62l
page 6 lines 62-69
page 9 lines 158-170
page 11 lines 65-80 (two overfull boxes)
ijcai.tex[1,smc]
page 7 lines 128-133
You should probably see if there is any rewording that you are willing
to do on these paragraphs.
∂27-Nov-84 0826 BERG@SU-SCORE.ARPA books
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 27 Nov 84 08:26:16 PST
Date: Tue 27 Nov 84 08:21:29-PST
From: Kathy Berg <BERG@SU-SCORE.ARPA>
Subject: books
To: jmc@SU-AI.ARPA
Stanford-Phone: (415) 497-4776
I would appreciate your letting me know if you plan to use
a textbook next quarter. Time is growing short, and
if the text is not ordered soon, it will not arrive in
time for the beginning of classes.
Thank you for your kind attention to this request.
Kathy
-------
∂27-Nov-84 0945 AMAREL@RUTGERS.ARPA Re: [Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>: Artificial Intelligence Movie]
Received: from RUTGERS.ARPA by SU-AI.ARPA with TCP; 27 Nov 84 09:44:52 PST
Date: 27 Nov 84 12:39:43 EST
From: AMAREL@RUTGERS.ARPA
Subject: Re: [Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>: Artificial Intelligence Movie]
To: AAAI-OFFICE@SUMEX-AIM.ARPA
cc: Bledsoe@UTEXAS-20.ARPA, Buchanan@SUMEX-AIM.ARPA, Brachman@SRI-KL.ARPA,
KRD%MIT-OZ@MIT-XX.ARPA, Engelmore@SUMEX-AIM.ARPA, Lerman@SRI-KL.ARPA,
Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA, JMC@SU-AI.ARPA,
Nilsson@SRI-AI.ARPA, Reddy@CMU-CS-A.ARPA, Rich%MIT-OZ@MIT-XX.ARPA,
Stan@SRI-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA, Stefik@XEROX.ARPA,
Tenenbaum@SRI-KL.ARPA, Walker@SRI-AI.ARPA, Webber%upenn@UDEL-RELAY.ARPA,
PHW@MIT-MC.ARPA, AMAREL@RUTGERS.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of 26 Nov 84 20:54:13 EST
Claudia, I am in favor of AAAI support for this film - within the conditions
that you outline in your msg. It is a good opportunity to help in the
dissemination of information about outstanding AI work in the general area
of KB-systems. Regards, Saul
-------
∂27-Nov-84 1318 SMC cars
The Subaru dealers seemed to think that the car was pretty good, but they did
not do a complete check. My current feeling is that I can do as well and buy
a car that Gary will work on. I may not find one with all of the extras that
the subaru has but I might be alot better off in the long run. The ford
dealer has a bunch of used cars and used mini pick-ups, that sound like good
possibilities.
(Someone who is selling cars at a rate of 100/week-end, is probably in a
better position to give me a good deal than the Dodge place which moaned
about selling only 5 in one day.
∂27-Nov-84 1411 BSCOTT@SU-SCORE.ARPA Joint US-Japanese Collaboration
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 27 Nov 84 14:07:45 PST
Date: Tue 27 Nov 84 14:07:31-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Joint US-Japanese Collaboration
To: JMC@SU-AI.ARPA, MS@SU-AI.ARPA, JK@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
A Dr. Wallace at NSF would tell us very little except that the proposal is
still being reviewed. He said he would be glad to talk with John about it
if he wishes to call. The number is (202) 357-6558.
Betty
-------
∂27-Nov-84 1417 RA
I will leave @2:45 today for a doctor appointment.
∂27-Nov-84 1427 RA on your desk
I left an envelop from dina bolla on your dsk.
∂27-Nov-84 1436 FISHER@SU-SCORE.ARPA Richard Karp
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 27 Nov 84 14:36:27 PST
Date: Tue 27 Nov 84 14:22:59-PST
From: Norine Fisher <FISHER@SU-SCORE.ARPA>
Subject: Richard Karp
To: faculty@SU-SCORE.ARPA
cc: molender@SRI-AI.ARPA
Richard Karp will be on campus Friday, November 30 to meet with faculty members.
Those wishing to meet with him should contact Gene Golub for that schedule.
Gene will be scheduling Dick's time after talking with him later this week.
Norine
-------
∂27-Nov-84 1526 LEP Industrial Lectureships
There have been some requests from the students for a lecturer in the area
of Software Engineering. I'm not sure how to go about soliciting such a
person, though.
Did you look at my learning stuff?
- Leslie
∂27-Nov-84 1656 @SU-CSLI.ARPA:TW@SU-AI.ARPA Thoughts on today's meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 27 Nov 84 16:56:44 PST
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Tue 27 Nov 84 16:52:20-PST
Date: 27 Nov 84 1653 PST
From: Terry Winograd <TW@SU-AI.ARPA>
Subject: Thoughts on today's meeting
To: principals@SU-CSLI.ARPA
I had to leave the meeting today before it was over, but had a few
thoughts about how to organize the possibilities. I will describe it in
terms of a few different models (or prototypes), recognizing that the
reality is never exactly llke any of them.
1) The critical mass model
The Center as organized and funded by SDF was based on the assumption that
a group of people with diverse interests, methodologies, home
institutions, and other activities could be brought together into
sufficiently intense contact (by providing lots of money) that within a
relatively short time, the contact would lead them to recognize a key set
of ideas that unified their fields, and there would be a theoretical
explosion based on these ideas. Much of the strategy for space, computing
environment, etc. was intended to increase the possibility (and need) for
strong interaction. Whether this in fact was possible in any time period
we will never know. What is clear is that one year wasn't enough, and the
budget crisis more or less ended the chance that it would happen. At this
point it is not a workable model.
2) The sugar daddy model
For many of the individual participants in the Center, the critical mass
model was more of an ideal than a reality. The reality was the
availability of significant amounts of funding without the need to request
and justify it item by item in proposals to funding agencies. This
flexibility has made it possible to do many good but diverse things. The
problem of course is that it won't last. If by a stroke of fortune a new
angel came along, we would all be delighted, but there is no reason to
expect there to be one (IBM, MCC, etc. included), even with any amount of
fundraising work. We have to accept the fact that SDF was unique.
We therefore need to adopt one (or more) of the models that do not count
on large infusions of fairly open-ended funds.
3) The service-provider model
The diagram Jon put on the board at the beginning suggested a view of CSLI
as a service organization, providing things to people whose central base
is elsewhere, in exchange for funds. What it has to offer is essentially
administrative and computational support. Such a center might well be
viable, assuming that it can compete in effectiveness (both financial
costs and intangibles like hassle) with the alternatives, provided by SRI,
PARC, the CS Department, etc. Continued funding would be based purely on
what was paid for the services. Since we have a large amount of capital
equipment on hand, computation can be provided with only incremental
(staff, maintenance, etc.) costs and could therefore be competitive. I am
not sure about administrative services, because of the complexity of how
the organization was put together. In aay case, it is not clear that it
is in the interest of any of the principals to do this, as opposed to
making effective use of their own service-providers. It could be an
adjunct to one of the other models.
4) The get-together model
One thing a center can do is provide a place where people from independent
institutions (departments) can get together occasionally to exchange
ideas, make connections, etc. Much of the Sloan money in cognitive
science went into supporting this kind of activity, and David Israel
described this kind of situation at MIT. It is limited both in its
potentials and in its costs, and can be useful when there are already
strong groups with some common ground, as is the case here. It would take
a relatively low level of administrative and financial commitment, and
might not justify the maintenance of a "center" with the amount of
structure we now have.
5) The national center model
One direction was to seek NSF funding to be a national center, rather than
a local research organization. This might be an interesting and challenging
thing to do, but would not solve the immediate needs -- it would not
provide a stable base of research support for those at Stanford, SRI and
Xerox, and the administrative load would be very high. If some individual
wanted to take this on as a mission in life, it might be done, but it does
not really substitute for what we have now.
6) The research project model
The point made by Brian and others was that the center as a whole needed
to be based on a coherent content. This is a criterion usually applied to
individual projects, and one possibility is for the center to become such.
This would mean choosing a relatively small subset of what is now being
done (even the current Area divisions are probably too broad, and it might
cut across them anyway). Such a "lean mean" center would then compete for
funds on the basis of its specific research, without attempting to bring
in large amounts for diverse purposes. Of course, if the one area got big
enough it could provide many of the things we wanted to support, but only
within its specific subject area. Two related questions arise with this
model: how it compares with developing the same narrowed project in our
other institutions, and which research would be continued.
There are a variety of answers. Those for whom the existing computer
facilities are especially useful might find a big advantage in keeping
them. People from Xerox might find it a useful way to get grants from
agencies that could not give them directly to a profit-seeking company.
The philosophers might find it easier to get grants through this kind of
center than simply through the department. Each of us needs to consider
these against the costs in terms of time and effort to organize and
maintain the project. In the end, it seems that if this model is adopted,
the choice of focus will be largely determined by those people for whom
the advantages are great enough to justify putting in the work to make it
happen. If there is more than one such group, the center can be
maintained (possibly with one or both of the above functions) as a unity,
along with the projects.
The key in all of this, of course, is the need for people who see one or
another model as enough in their self-interest (including their broad
self-interest in developing a field) to take a significant amount of their
time. Today's meeting didn't bring any stirring amounts of energy to
light, but we need to see what develops with further thought.
∂27-Nov-84 1707 BARWISE@SU-CSLI.ARPA [Terry Winograd <TW@SU-AI.ARPA>: Thoughts on today's meeting ]
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 27 Nov 84 17:07:12 PST
Date: Tue 27 Nov 84 17:02:04-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: [Terry Winograd <TW@SU-AI.ARPA>: Thoughts on today's meeting ]
To: Initiators@SU-CSLI.ARPA
Here is a message from Terry that was distributed to only the
principals. It has some good food for thought.
---------------
Return-Path: <TW@SU-AI.ARPA>
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Tue 27 Nov 84 16:52:20-PST
Date: 27 Nov 84 1653 PST
From: Terry Winograd <TW@SU-AI.ARPA>
Subject: Thoughts on today's meeting
To: principals@SU-CSLI.ARPA
I had to leave the meeting today before it was over, but had a few
thoughts about how to organize the possibilities. I will describe it in
terms of a few different models (or prototypes), recognizing that the
reality is never exactly llke any of them.
1) The critical mass model
The Center as organized and funded by SDF was based on the assumption that
a group of people with diverse interests, methodologies, home
institutions, and other activities could be brought together into
sufficiently intense contact (by providing lots of money) that within a
relatively short time, the contact would lead them to recognize a key set
of ideas that unified their fields, and there would be a theoretical
explosion based on these ideas. Much of the strategy for space, computing
environment, etc. was intended to increase the possibility (and need) for
strong interaction. Whether this in fact was possible in any time period
we will never know. What is clear is that one year wasn't enough, and the
budget crisis more or less ended the chance that it would happen. At this
point it is not a workable model.
2) The sugar daddy model
For many of the individual participants in the Center, the critical mass
model was more of an ideal than a reality. The reality was the
availability of significant amounts of funding without the need to request
and justify it item by item in proposals to funding agencies. This
flexibility has made it possible to do many good but diverse things. The
problem of course is that it won't last. If by a stroke of fortune a new
angel came along, we would all be delighted, but there is no reason to
expect there to be one (IBM, MCC, etc. included), even with any amount of
fundraising work. We have to accept the fact that SDF was unique.
We therefore need to adopt one (or more) of the models that do not count
on large infusions of fairly open-ended funds.
3) The service-provider model
The diagram Jon put on the board at the beginning suggested a view of CSLI
as a service organization, providing things to people whose central base
is elsewhere, in exchange for funds. What it has to offer is essentially
administrative and computational support. Such a center might well be
viable, assuming that it can compete in effectiveness (both financial
costs and intangibles like hassle) with the alternatives, provided by SRI,
PARC, the CS Department, etc. Continued funding would be based purely on
what was paid for the services. Since we have a large amount of capital
equipment on hand, computation can be provided with only incremental
(staff, maintenance, etc.) costs and could therefore be competitive. I am
not sure about administrative services, because of the complexity of how
the organization was put together. In aay case, it is not clear that it
is in the interest of any of the principals to do this, as opposed to
making effective use of their own service-providers. It could be an
adjunct to one of the other models.
4) The get-together model
One thing a center can do is provide a place where people from independent
institutions (departments) can get together occasionally to exchange
ideas, make connections, etc. Much of the Sloan money in cognitive
science went into supporting this kind of activity, and David Israel
described this kind of situation at MIT. It is limited both in its
potentials and in its costs, and can be useful when there are already
strong groups with some common ground, as is the case here. It would take
a relatively low level of administrative and financial commitment, and
might not justify the maintenance of a "center" with the amount of
structure we now have.
5) The national center model
One direction was to seek NSF funding to be a national center, rather than
a local research organization. This might be an interesting and challenging
thing to do, but would not solve the immediate needs -- it would not
provide a stable base of research support for those at Stanford, SRI and
Xerox, and the administrative load would be very high. If some individual
wanted to take this on as a mission in life, it might be done, but it does
not really substitute for what we have now.
6) The research project model
The point made by Brian and others was that the center as a whole needed
to be based on a coherent content. This is a criterion usually applied to
individual projects, and one possibility is for the center to become such.
This would mean choosing a relatively small subset of what is now being
done (even the current Area divisions are probably too broad, and it might
cut across them anyway). Such a "lean mean" center would then compete for
funds on the basis of its specific research, without attempting to bring
in large amounts for diverse purposes. Of course, if the one area got big
enough it could provide many of the things we wanted to support, but only
within its specific subject area. Two related questions arise with this
model: how it compares with developing the same narrowed project in our
other institutions, and which research would be continued.
There are a variety of answers. Those for whom the existing computer
facilities are especially useful might find a big advantage in keeping
them. People from Xerox might find it a useful way to get grants from
agencies that could not give them directly to a profit-seeking company.
The philosophers might find it easier to get grants through this kind of
center than simply through the department. Each of us needs to consider
these against the costs in terms of time and effort to organize and
maintain the project. In the end, it seems that if this model is adopted,
the choice of focus will be largely determined by those people for whom
the advantages are great enough to justify putting in the work to make it
happen. If there is more than one such group, the center can be
maintained (possibly with one or both of the above functions) as a unity,
along with the projects.
The key in all of this, of course, is the need for people who see one or
another model as enough in their self-interest (including their broad
self-interest in developing a field) to take a significant amount of their
time. Today's meeting didn't bring any stirring amounts of energy to
light, but we need to see what develops with further thought.
-------
∂27-Nov-84 2039 JOHN@SU-CSLI.ARPA [Jon Barwise <BARWISE@SU-CSLI.ARPA>: Next meeting]
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 27 Nov 84 20:39:34 PST
Date: Tue 27 Nov 84 20:36:22-PST
From: John Perry <JOHN@SU-CSLI.ARPA>
Subject: [Jon Barwise <BARWISE@SU-CSLI.ARPA>: Next meeting]
To: f4@SU-CSLI.ARPA
cc: pkanerva@SU-CSLI.ARPA
This talk may be of interest to f4ers and well as f1ers.
---------------
Mail-From: BARWISE created at 27-Nov-84 17:19:43
Date: Tue 27 Nov 84 17:19:43-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Next meeting
To: F1@SU-CSLI.ARPA
John says: Penti Kanerva will speak in two weeks on human and computer
memory. His CSLI report on this will be available on the little table
by the door on Thursday, if things go well.
-------
-------
∂28-Nov-84 0004 SMC favor
Could you please take my laundry out of the dryer when it is dry. I don't think
Carolyn likes it if it is in there when she dries her towel in the morning or
if she does her own laundry. It was going in to the dryer at 00:10.
Thanks very much.
∂28-Nov-84 1149 LIBRARY@SU-SCORE.ARPA New Books in the Math/CS Library
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Nov 84 11:49:15 PST
Date: Wed 28 Nov 84 11:44:31-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: New Books in the Math/CS Library
To: su-bboard@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
Human Factors in Computer Systems by Thomas and Schneider QA76.9.P75H86 1984 c.2
Pictorial Data Analysis by Haralick TA1632.N33 1982
New Horizons in Educational Computing by Yazdani LB1028.5N37 1984 c.2
Methods of Numerical Numerical Integration by David and Rabinowitz QA299.3.D28 }6n}w#oL C|
1984
Understanding ADA by Shumate QA76.73.A35S48 1984
Fundamental Programming With Pascal by Starkey and Ross QA76.73.P2S73 1984
H. Llull
-------
∂28-Nov-84 1742 BARWISE@SU-CSLI.ARPA Carry over
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 28 Nov 84 17:42:37 PST
Date: Wed 28 Nov 84 17:29:09-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Carry over
To: Initiators@SU-CSLI.ARPA
A question has come up about initiator funds, one I answered at at
least one of the lunches we had about them, but did not put in the
letter, I guess. You are free to save money this year and use it next
year. It will not go away.
-------
∂28-Nov-84 2156 MADSEN@SU-CSLI.ARPA CSLI workshop on semantics of programs
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 28 Nov 84 21:56:41 PST
Date: Wed 28 Nov 84 21:52:59-PST
From: Ole Lehrmann Madsen <MADSEN@SU-CSLI.ARPA>
Subject: CSLI workshop on semantics of programs
To: WSMAILALL: ;
cc: trudy@SU-CSLI.ARPA, madsen@SU-CSLI.ARPA
The following is a list of participants in the workshop. If you are not
on the list and wants to participate, please send mail to TRUDY@CSLI
before FRIDAY as we have to order the food on Friday.
Remember to include a US-mail address. If you did not do that in your
original answer to Trudy please send her your address. We plan to send out
maps by Thursday.
We are looking forward to seing you on Tuesday.
1. Brian Smith
2. Jon Barwise
3. Joe Goguen
4. Terry Winograd
5. Peter Deutsch
6. John McCarthy
7. Vaughan Pratt
8. Jim Donahue
9. Mike Dixon
10. John Lamping
11. Greg Nelson
12. Kurt Normark
13. Pavel Curtis
14. Greg Nuyens
15. Mike Lowry
16. Paul Oppenheimer
17. Peter Karp
18. Ray Perrault
19. Per Kristian
20. Larry Moss
21. David Israel
22. Kirk Kelley
23. Brad Hartfield
24. Curtis Abbot
25. Gerald Gazdar
26. Peter Ladkin
27. Kathy Hall
28. Yoni Malachi
29. Liam Peyton
30. Shigeki Goto
31. Masahiko Sato
32. Jose Meseguer
33. Mark Linton
34. McCall
35. Danny Bobrow
36. Ron Brachman
37. Dave Robson
38. Bob Felman
39. S. Prehn
40. Kaizhi Yue
41. Ole Lehrmann Madsen
-------
-------
-------
∂28-Nov-84 2317 SMC cars
I think I have located a good car (1978 Toyota wagon, 50K miles) Gary is
going to look at it tomorrow, if it passes, I will get in touch with you
about paying for it. The advice that I am getting is that rather than
borrowing money from you and paying outright, I should finance a little
bit of it and thereby establish a credit rating. I asked several people
about it (Susie, Martha, etc.) and they seem to think that is a good idea.
If you have any opinions on the matter please let me know.
∂28-Nov-84 2355 @SU-CSLI.ARPA:CLT@SU-AI.ARPA SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 28 Nov 84 23:55:47 PST
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Wed 28 Nov 84 23:51:41-PST
Date: 28 Nov 84 2347 PST
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: SEMINAR IN LOGIC AND FOUNDATIONS OF MATHEMATICS
To: "@DIS.DIS[1,CLT]"@SU-AI.ARPA
Speaker: Prof. Rolando Chuaqui, Catholic University of Chile and IMSSS
Title: A Semantical Definition of Probability
Place: Room 381-T, 1st floor Math. Corner, Stanford University
Time: Monday December 3, 4:15-5:30 p.m.
Abstract:
The analysis proposed in this lecture, is an attempt to formalize
both chance and degree of support. Chance is considered as a
dispositional property of the objects plus the experimental
conditions (i.e. what is called the chance set-up). Degree of
support measures the support that the evidence we have
(i.e. what we accept as true) gives to propositions. Chance,
in this model, is determined by the set K of possible outcomes
(or results) of the chance set-up. Each outcome is represented
by a relational structure of a certain kind. This set of
structures determines the algebra of events, an algebra of subsets
of K, and the probability measure through invariance under a
group of symmetries. The propositions are represented by the
sentences of a formal language, and the probability of a sentence,
phi in K, P[K](phi), is the measure of the set of models of phi
that are in K. P[K](phi) represents the degree of support of
phi given K. This definition of probability can be applied to
clarify the defferent methods of statistical inference and
decision theory.
S. Feferman
∂29-Nov-84 0926 FEIGENBAUM@SUMEX-AIM.ARPA [Bruce Delagi <DELAGI@SUMEX-AIM.ARPA>: Alpha, Elis, and ...]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 29 Nov 84 09:25:53 PST
Date: Thu 29 Nov 84 09:26:14-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: [Bruce Delagi <DELAGI@SUMEX-AIM.ARPA>: Alpha, Elis, and ...]
To: jmc@SU-AI.ARPA
JOHN, THIS IS A FOLLOWUP TO A CONVERSATION I HAD WITH MY GROUP ABOUT TWO
FAST LISP MACHINES (ALPHA AND ELIS) THAT I SAW IN JAPAN.....ED
---------------
Mail-From: DELAGI created at 29-Nov-84 06:41:37
Date: Thu 29 Nov 84 06:41:37-PST
From: Bruce Delagi <DELAGI@SUMEX-AIM.ARPA>
Subject: Alpha, Elis, and ...
To: feigenbaum@SUMEX-AIM.ARPA, nii@SUMEX-AIM.ARPA, brown@SUMEX-AIM.ARPA,
schoen@SUMEX-AIM.ARPA, rindfleisch@SUMEX-AIM.ARPA, davies@SUMEX-AIM.ARPA,
yan@SUMEX-AIM.ARPA, saraiya@SUMEX-AIM.ARPA, shahn@SUMEX-AIM.ARPA,
aiello@SUMEX-AIM.ARPA, rpg@SU-AI.ARPA
Date: 14 Nov 84 09:31:35 PST (Wed)
From: Jed Marti <marti@randgr>
Subject: Japanese Lisp Machines.
I just saw the request for information about the Fujitsu Alpha. I
recently spent a week in Japan as a guest of the RIKEN institute which
provided a tour of some of the local Tokyo efforts in this direction.
Perhaps it would be of interest to the AIList readers.
Jed Marti.
Japanese Lisp Machines
The RSYMSAC conference held at the Riken institute in Saitama, Japan on
August 21-22, provided an opportunity for a close view of Japanese
efforts to construct very fast machines for running large scale
symbolic algebra and AI programs. Four of us toured two computer
centers and three Lisp machine construction projects, talking to
implementors and trying our favorite test programs. This short report
describes the state of their systems and the Japanese symbolic algebra
environment.
FLATS at Riken
The Riken institute conducts research in the physical sciences and
operates a Fujitsu M380H (an IBM 370 look-alike) providing both time
sharing and batch services. During the day, computer algebra system
users access Cambridge Lisp running REDUCE 3.1. The symbolic
computation group operates a VAX 11/750 running VMS, a host of 16 bit
micro-computers, and the FLATS machine.
The symbolic computation group officially unveiled FLATS (Formula Lisp
Association Tuple Set) at the conference. The Mitsui Ship Building
Company constructed the hardware based on designs of the Riken group.
Built from SSI ECL components, the CPU executes a micro-instruction
every 50 nanoseconds and a Lisp instruction every 100 nanoseconds from
a 300 bit by 256 word micro store and 8 megabytes of 450 nanosecond
main memory. Over 70,000 wires connect the back plane making
conventional hardware debugging impossible. The engineers exercise
modules on a special test jig or through the attached support
processor.
The hash code generation hardware sets FLATS apart from conventional
Lisp machines. It computes a hash code in the basic machine cycle time
for extremely fast property list access and CONS cell generation.
Improvements in execution speed and program clarity more than offset
the loss of the RPLACA and RPLACD functions on hashed CONSes.
The designers increased speed with a number of special features:
3 separate cache memories for instructions, data, and stack
special micro-coded instructions for the garbage collector and
big numbers
CALL, JUMP and RETURN executed in parallel with other instructions
hardware type checking in parallel with data operations
3 address instruction codes
hardware support for paging
data path width of 64 bits
The FLATS machine, without hash CONS and property lists, runs REDUCE
3.0 at about IBM 3033 speeds. Several papers presented at RSYMSAC
described the status of FLATS and the design of the next FLATS machine
that the group hopes to construct from Josephson Junction circuits
[2-3].
University of Tokyo Computer Center
We visited the University of Tokyo Computer Center to find out more
about UTILISP (University of Tokyo Interactive LISP) implemented by the
Department of Mathematical Engineering and Instrumentation Physics
[1]). Probably one of the largest academic installations in the world,
the center operates two Hitachi M280 dual processors (roughly
equivalent to an IBM 3081) each with 32 megabytes of main storage and a
Hitachi M200H with 16 megabytes of main storage. A Hitachi S810/2
vector processor with 64 megabytes of main memory and a VAX 11/780 with
4 megabytes complement the general purpose machines. On-line storage
consists of 48 gigabytes on disk, and 37 gigabytes in data cells. The
center emphasizes user convenience. Users mount their own tapes, take
output off printers, read their own card decks (we didn't actually see
anyone do this, but the machine was there), tear off plots and so on.
The lightly loaded machines run an average of only 4,000 jobs per day.
Users need not wait for terminals and other equipment, an enviable
situation indeed.
UTILISP resembles MacLisp. An effort to transport MACSYMA to UTILISP
suffers only from the lack of built-in big number arithmetic.
Fujitsu ALPHA
A long train and subway ride brought us to the third tour stop, the
Fujitsu Laboratories in Kawasaki, home of the Lisp machine ALPHA [4-5].
The ALPHA offloads time sharing symbolic processing jobs from IBM style
mainframes. More than one ALPHA can be connected to a single mainframe,
which supplies I/O device, filing system, editing and operating system
support.
The ALPHA has 8 megabytes of real memory with a 16 megabyte virtual
address space. Memory and data buses are 32 bits wide with Lisp items
composed of an 8 bit tag and 24 bit value. The ALPHA processor has a
high speed hardware stack of 8k words with special hardware for
swapping segments to and from slower memory. The division of the stack
into blocks permits high speed switching between different processes.
To support tagged data items, a micro-instruction jump based on the 8
bit tag is implemented. The ALPHA machine performs data calculations by
masking off the tag bits in hardware, rather than software. The machine
has over 7700 STTL, 64k bit RAMs and 4k high speed RAMs.
Micro Instructions - 48 bits wide, 160 ns, 16k words.
Main Memory - Virtual 16 M words, Real 8 M words,
Page size 4 K bytes.
Stack - Logical stack 64 K words, Hardware stack 8 K words,
Swapping block size 2 K bytes.
The ALPHA runs UTILISP and has an interpreter, compiler, and copying
garbage collector. Fujitsu claims the ALPHA runs three times faster
than the Symbolics 3600 and 5 times faster than DEC 2060 MACLISP.
Fujitsu uses the ALPHA for CAD, machine translation, and natural
language understanding.
ELIS - Nippon Telegraph and Telephone Public Corporation
Nippon Telegraph and Telephone Public Corporation demonstrated the ELIS
machine and TAO language a "harmonic" mixture of Lisp, Smalltalk, and
Prolog, to quote the authors [6]. A PDP 11/60 provides file and
operating system support while the ELIS hardware performs the list
processing functions. The ELIS hardware features 32 bit items with 8
bit tags providing for 16 million items (128 megabytes). The basic
microcycle time is 180 ns in 32k of micro-instructions 64 bits wide.
Main memory is 4 megabytes with an access time of 420 ns and a special
system stack of 32k 32 bit items. Deep binding is used and multiple
processes are supported by stack groups, and the cpu switches between
contexts very fast (2 microseconds unless there is some stack
swapping). For identical tasks programmed in the three different
paradigms, the procedural version provides the most speed with the
object oriented version about 1.1 times as slow and the logic version
about twice as slow.
Acknowledgement: I would like to thank Dr. N. Inada of Riken for
organizing both RSYMSAC and the tour.
List of References
1. Chikayama, Takashi, `UTILISP Manual', Technical Report METR 81-6
(September 1981), Department of Mathematical Engineering and
Instrumentation Physics, University of Tokyo, Bunkyo-Ku, Tokyo,
Japan.
2. Goto, E., Shimizu, K., `Architecture of a Josephson Computer
(FLATS-2)', RSYMSAC, Wako-shi, Saitama, 351-01 Japan, 1984.
3. Goto, E., Soma, T., Inada, N., et al, 'FLATS: A Machine for
Symbolic and Algebraic Manipulation', RSYMSAC, Riken, Wako-shi,
Saitama, 351-01 Japan, 1984.
4. Hayashi, H., Hattori, A., Akimoto, H., `ALPHA: A High-Performance
LISP Machine with a New Stack Structure and Garbage Collection
System', Proceedings of the 10th Annual International Symposium
on Computer Architecture, pages 342-347.
5. Hayashi, H., Hattori, A., Akimoto, H., `LISP Machine "ALPHA"',
Fujitsu Scientific and Technical Journal, Vol. 20, No. 2,
pages 219-234.
6. Okuno, H. G., Takeuchi, I., Osato, N., Hibino, Y., Watanabe, K.,
`TAO: A Fast Interpreter-Centered System on Lisp Machine ELIS',
Proceedings of the 1984 Conference on LISP and Functional
Programming.
Jed Marti MARTI@RAND-UNIX
------------------------------
-------
-------
∂29-Nov-84 0938 LIBRARY@SU-SCORE.ARPA AT&T BELL LABORATORIECHNICAL JOURNAL: ISSUE ON UNIX
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 Nov 84 09:38:37 PST
Date: Thu 29 Nov 84 09:26:34-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: AT&T BELL LABORATORIECHNICAL JOURNAL: ISSUE ON UNIX
To: SU-BBOARDS@SU-SCORE.ARPA
cc: PMB@SU-AI.ARPA, FACULTY@SU-SCORE.ARPA,
: ;
AT&T Bell Laboratories Technical Journal, October 1984, Vol. 63, No. 8,
part 2 is devoted to the UNIX system. We have received a copy of the issue
and will probably place it on reserve or in the technical reports collection.
We do not have a subscription to that journal in Math/CS. However Engineering
does have a subscription to the journal. Some of you have had problems finding
it in Engineering. That is because the journal has changed titles and is now
under A for AT&T instead of B for Bell Labs.
Harry Llull
-------
∂29-Nov-84 1025 RA nonmonotonic bibliography
There is an updated bibliography list now on nonmon[1,jmc]. This is
a combination of the old list and Perlis list. The papers we don't have
are marked by %.
∂29-Nov-84 1430 ERIC@SU-CSLI.ARPA Laurence R. Brothers
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 29 Nov 84 14:29:26 PST
Date: Thu 29 Nov 84 14:29:25-PST
From: Eric Ostrom <ERIC@SU-CSLI.ARPA>
Subject: Laurence R. Brothers
To: jmc@SU-AI.ARPA
John:
Laurence worked briefly for us last year. I didn't have
time to form much of an impression of him. He has asked me to
write a reccomendation for him, and I gather you have agreed
to do this. I am prepared to accept your judgement on this.
eric
-------
∂29-Nov-84 1547 RA Visitors from China
Yan, You-Alant who is the director of China Association of AI and related to
North Chine Institute of Computer Technology is now working-
visiting Silicon Valley. He wants to meet with people in AI at Stanford,
Do you have time to meet with him? Please let me know. If yes, when will be
a convenitent date and time?
∂29-Nov-84 1604 HULLMAN@SU-SCORE.ARPA postdocs
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 Nov 84 16:03:58 PST
Date: Thu 29 Nov 84 15:58:25-PST
From: Holly Ullman <HULLMAN@SU-SCORE.ARPA>
Subject: postdocs
To: faculty@SU-SCORE.ARPA
If any postdoctoral fellows are currently working with you, they can
be listed, after the research associates, in the report - provided
that someone writes a brief bio of each one by Monday, absolutely.
-------
∂29-Nov-84 1711 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA next F4 meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 29 Nov 84 17:11:06 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Thu 29 Nov 84 17:10:02-PST
Date: Thu 29 Nov 84 17:09:37-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: next F4 meeting
To: f4@SU-CSLI.ARPA
cc: ingrid@SU-CSLI.ARPA
The next F4 meeting will be Tuesday, Dec. 4, at 3:15 in the Ventura
conference room. We will discuss the last three chapters of the
Harman ms. Please be thinking of specific suggestions for what to do
next.
--Bob
-------
∂29-Nov-84 1739 @MIT-MC:RICH@MIT-OZ [Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>: Artificial Intelligence Movie]
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 29 Nov 84 17:39:15 PST
Date: 29 Nov 1984 20:38 EST (Thu)
Message-ID: <RICH.12067554796.BABYL@MIT-OZ>
From: Charles Rich <RICH%MIT-OZ@MIT-MC.ARPA>
To: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Cc: Amarel@RUTGERS.ARPA, Bledsoe@UTEXAS-20.ARPA, Brachman@SRI-KL.ARPA,
Buchanan@SUMEX-AIM.ARPA, Engelmore@SUMEX-AIM.ARPA,
Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA, JMC@SU-AI.ARPA,
KRD%MIT-OZ@MIT-XX.ARPA, Lerman@SRI-KL.ARPA, Nilsson@SRI-AI.ARPA,
PHW@MIT-MC.ARPA, Reddy@CMU-CS-A.ARPA, Rich%MIT-OZ@MIT-XX.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Stan@SRI-AI.ARPA, Stefik@XEROX.ARPA,
Tenenbaum@SRI-KL.ARPA, Walker@SRI-AI.ARPA, Webber%upenn@UDEL-RELAY.ARPA
Subject: [Ellie Engelmore <EENGELMORE@SUMEX-AIM.ARPA>: Artificial Intelligence Movie]
In-reply-to: Msg of 26 Nov 1984 20:54-EST from AAAI <AAAI-OFFICE at SUMEX-AIM.ARPA>
I think we should go ahead with this and see how we feel about it
afterwards in terms of future policy. I have two suggestions for the
present:
(1) We should reserve the *right* to have an acknowledgement to AAAI
in the film, but at our choice after some part of the Excom has viewed
the rough cut. Since such an acknowledgement can also be easily
construed as an endorsement, it is important that the Excom is
comfortable with such an endorsement. Since I assume the form of the
acknowledgement would only be a written credit added in postproduction
this should be quite feasible. I suggest that the logistics of
this viewing be written into the grant from the beginning. Perhaps
a committe of two or three non-Stanford Excom members in Bay area
would be most convenient given the time constraints. (I would be
happy to volunteer also.)
(2) I suggest we advertise this fact in the next issue of AI Magazine
and invite other films to be sponsored. I think that such films in
general are an excellent idea. It would be particulary nice if AAAI
seed money could facilitate some (possibly less ambitious) films or
videotapes from smaller, less wealthy sites that are doing work.
If this really gets going, how about establishing an AAAI film lending
library (at minimal cost to educational institutions, slightly more
to industry).
-Chuck.
∂29-Nov-84 1824 @SU-SCORE.ARPA:JMC@SU-AI.ARPA special seminar
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 Nov 84 18:24:17 PST
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Thu 29 Nov 84 18:10:09-PST
Date: 29 Nov 84 1810 PST
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: special seminar
To: faculty@SU-SCORE.ARPA
Monica M. Strauss from MIT Laboratory for Computer Science will give
a special seminar on "Computer Science Research Environments in the
US and Japan", on Friday November 30, at 3:00 pm, room 301.
∂29-Nov-84 2111 WIEDERHOLD@SUMEX-AIM.ARPA Re: special seminar
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 29 Nov 84 21:10:52 PST
Date: Thu 29 Nov 84 21:11:24-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
Subject: Re: special seminar
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 29 Nov 84 18:10:00-PST
I'd like to come, but it conflicts with the regular CS345 seminar. Gio
-------
∂29-Nov-84 2136 FEIGENBAUM@SUMEX-AIM.ARPA Re: Japanese Lisp machines
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 29 Nov 84 21:36:29 PST
Date: Thu 29 Nov 84 21:37:16-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: Japanese Lisp machines
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 29 Nov 84 10:51:00-PST
John,
I think it would be great if Shigeki Goto would give a talk about TAO
and ELIS. I would be glad to use the Friday SIGLUNCH mechanism for this
if you like. Or the CSD Colloquium mechanism could be used. Or as special
seminar.
Rumors re commercial availability of Japanese machines:
(gleaned on my visit to Japan a two weeks ago)
a. Fujitsu ALPHA...discussions under way re Amdahl marketing ALPHA in
this country. Requires some software changes (easy) to adapt to an
IBM or AMDAHL channel rather than a Fujitsu channel. Might be available
in USA as early as summer 1985. Marketing in USA is by no means a certainty.
b. NTT ELIS. No plans. In fact, no manufacturing agreement in place with
any machine-building firm.
c. Mitsubishi SIM-P (the ICOT PSI Prolog machine built by Mitsubishi):
might be on the market, at least in Japan, by summer 1985. No rumors
regarding USA availability.
d. NEC high-speed Prolog machine. Not even running yet. But might be
marketed by summer of 1986 , at least in Japan.
Ed
-------
∂29-Nov-84 2303 rmeier@su-star request for incomplete
Received: from SU-STAR.ARPA by SU-AI.ARPA with TCP; 29 Nov 84 23:03:24 PST
Date: 29 Nov 84 22:47:00 PST
From: R. MEIER <rmeier@su-star>
Subject: request for incomplete
To: jmc <jmc@sail>
Reply-To: R. MEIER <rmeier@su-star>
Dr. Cheriton, and Dr. McCarthy,
I was advised to undergo surgery on Tuesday, Nov. 26 and as this will
probably make it difficult to continue in your course (CS244, CS206), I was
wondering if you would allow me to take an incomplete for the course and to
complete the course next quarter. At this time, I have taken the midterm in
your course and I have started on the contention ring simulation in CS244. (I
have designed the program and have written most of it but have not debugged it
fully.) If convenient, you could call me at 961-0220 or send mail to
rmeier@star.
Thank you,
Bob Meier(rmeir@star)
------
∂30-Nov-84 0006 LLW@S1-A.ARPA Meeting
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 30 Nov 84 00:06:39 PST
Date: 30 Nov 84 0005 PST
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: Meeting
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA, RAH@S1-A.ARPA
John, for a variety of reasons, I'll be coming to Jerry's meeting in
Tarzana this weekend, driving down tomorrow afternoon and coming back
whenever it concludes on Sunday. I'll look forward to your riding
back with me, if you're still so inclined. Lowell
∂30-Nov-84 0958 RA Monica Strauss
I need Monica's ss number and address in order to pay her. Please ask
her to come by my office.
∂30-Nov-84 1017 BSCOTT@SU-SCORE.ARPA Chris Goad
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Nov 84 10:17:29 PST
Date: Fri 30 Nov 84 10:16:02-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Chris Goad
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
John, were you able to talk with Chris about the status of his leave?
Betty
-------
∂30-Nov-84 1103 RA
Gene Golub would like you to call him when you come in.
∂30-Nov-84 1123 cheriton@Pescadero SUN workstations
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 30 Nov 84 11:23:07 PST
Date: Fri, 30 Nov 84 11:21:24 pst
From: David Cheriton <cheriton@Pescadero>
Subject: SUN workstations
To: csdfacilities@Pescadero
I have a basic capital cost from SMI of roughly $9800 per 2 meg. workstation.
This includes a 30 percent discount, good only until 12/31/84.
Any rate, the problem is maintenance. They charge $165/month per workstation.
However, board exchange cost is on average $362.50 per component, including
power supply, etc. I have asked the sales rep. about building 20 board exchange
credits into the price - so we can bleed the dean.
Judging by my groups experience with these machines and 90 day warranty
that covers most failures we have had, I feel safe in going for a board
exchange style maintenance and will even commit to having our group take
care of the board exchanging (if necessary) since I expect the failure rate
to be low and we are doing this on our own machines now anyway.
So, does anyone have any problems with this plan. I expect the total cost
for 10 machines with board exchange credits to be about 100K, with cost to
CSD around $75K. I would like this committee to approve the plan and then
ask the dept./Gene for approval to issue the P.O., which I need to get out
by 12/31/84 by the current discount agreement.
∂30-Nov-84 1126 BSCOTT@SU-SCORE.ARPA Re: Goad
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Nov 84 11:25:54 PST
Date: Fri 30 Nov 84 11:24:31-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Re: Goad
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 30 Nov 84 11:09:00-PST
We really should process an official termination form--he is actually
terminated anyway, since a leave can be only for one year. In order to
reinstate him, an appointment would be necessary.
There is no problem with him participating in the joint study. If he is to
be paid from the funds, we could just pay him an honorarium or consulting
fee, and no staff benefit payment would be necessary. I think this is the
best way to go.
Betty
-------
∂30-Nov-84 1141 mogul@Navajo Re: SUN workstations
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 30 Nov 84 11:41:51 PST
Received: from Navajo.ARPA by Pescadero with TCP; Fri, 30 Nov 84 11:40:27 pst
From: Jeff Mogul <mogul@Navajo>
Date: 30 Nov 1984 1140-PST (Friday)
To: David Cheriton <cheriton@Pescadero>
Cc: csdfacilities@Pescadero
Subject: Re: SUN workstations
In-Reply-To: David Cheriton <cheriton@Pescadero> / Fri, 30 Nov 84 11:21:24 pst.
Your plan seems sound ... if we build the board-exchange credits into
the price, and if the dean doesn't notice ...
These are 1-board machines, right? So 20 board-exchange credits means
we can fix each one twice; seems like that should be good for several
years.
-Jeff
∂30-Nov-84 1148 RA Epistemology of AI
Paul Matteucci it a graduate student in the businees school. He would like to
take this course and wants to make sure that his background is sufficient
so he would like to talk to you some time. His # 873 1027 (h), best times for
him, Mon. Wed. or Fri. morning. Please let me know, and I'll relay the message
to him.
∂30-Nov-84 1243 PKANERVA@SU-CSLI.ARPA Reading for F1 meeting on Dec. 11
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 30 Nov 84 12:43:17 PST
Date: Fri 30 Nov 84 12:39:48-PST
From: Pentti Kanerva <PKANERVA@SU-CSLI.ARPA>
Subject: Reading for F1 meeting on Dec. 11
To: FInterest@SU-CSLI.ARPA
cc: Susi@SU-CSLI.ARPA
I will be talking about my work on memory (Report CSLI-84-7) on Tuesday
the 11th. As there aren't many copies of the report left, and some of
you may wish to read fewer than 175 pages, we have done the following:
(1) One-page abstract is on the small table next to the entrance to
Ventura Hall. (2) 11 pages of Introduction (Ned's idea--thanks) and
(3) the entire report are available at the front desk (please ask Susi).
(4) The entire report, short of illustrations, will also be availabe
on line as <PKANERVA>MEMORY @ TURING. Please do not print this file,
as it is in MSS format. You can read it best with NEW:MSS, but most
of it can be read fairly well with Emacs.
- Pentti
-------
∂30-Nov-84 1436 @SU-CSLI.ARPA:MS@SU-AI.ARPA A Seminar on Programming Language
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 30 Nov 84 14:36:30 PST
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Fri 30 Nov 84 14:32:33-PST
Date: 30 Nov 84 1418 PST
From: Masahiko Sato <MS@SU-AI.ARPA>
Subject: A Seminar on Programming Language
To: "@DIS.DIS[1,CLT]"@SU-AI.ARPA, cinterest@SU-CSLI.ARPA,
su-bboards@SU-AI.ARPA
Speaker: Prof. Paul J. Voda, The University of British Columbia
Title: A View of Programming Languages as Symbiosis of
Meaning and Computations
Place: Room 352, Margaret Jacks Hall, Stanford University
Time: Wednesday December 5, 3:00-4:00 p.m.
Abstract:
We prpose to explain the semantics of a programming language by means of
two formal theories. One formal theory gives denotations to programs
while the other one, which is actually a subtheory of the first theory,
specifies the operations of the computing machine executing the programs.
The computations correspond exactly to proofs in the weaker theory. We
are proposing to use formal theories rather than models because we have
in mind a practical use of the theories for computer-assisted verification
and transformation of programs.
Masahiko Sato
∂30-Nov-84 1437 BSCOTT@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Nov 84 14:37:27 PST
Date: Fri 30 Nov 84 14:30:13-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 30 Nov 84 14:09:00-PST
Will do, John. I will also send a note to H & S, confirming that Chris
probably will be working on the joint project.
Betty
-------
∂30-Nov-84 1600 JMC*
Ohlander
∂30-Nov-84 1704 SG greetings
To: JMC@SU-AI.ARPA
CC: monica@MIT-MC.ARPA, SG@SU-AI.ARPA
Prof. McCarthy,
It was good talking with you, and I enjoyed giving the lecture. The
conversation between Bosack, Goto, and myself was particularly
interesting. I am leaving tomorrow, so thanks for meeting with me.
I look forward to seeing you again sometime.
Monica Strauss
Monica@MIT-MC
∂30-Nov-84 1716 TAJNAI@SU-SCORE.ARPA Forum program
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Nov 84 17:16:31 PST
Date: Fri 30 Nov 84 17:14:05-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: Forum program
To: Moses@SU-SCORE.ARPA, JMC@SU-AI.ARPA
Yes, Yoram, we want you to speak. You responded to my message to
students, but John didn't respond to Brian's message to faculty.
I have not gotten back to everyone because a few of the nominated
students can't be accommodated.
Please send me a title as soon as possible.
Carolyn
-------
∂30-Nov-84 1732 CHEESEMAN@SRI-AI.ARPA Proposed Workshop
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 30 Nov 84 17:32:31 PST
Date: Fri 30 Nov 84 17:32:25-PST
From: P. Cheeseman <cheeseman@SRI-AI.ARPA>
Subject: Proposed Workshop
To: jmc@SU-AI.ARPA
cc: cheeseman@SRI-AI.ARPA, aaai-office@SUMEX-AIM.ARPA
Hi John,
The following is the information you requested on the proposed
"Probability and Uncertainty in AI" workshop.
The General Chairman is Peter Cheeseman (SRI International)
The Program Chairman is John Lemmer (PAR Corp.)
The Program committee is:
Leveen Kanal (Univ. of Maryland)
Judea Pearl (UCLA)
Eugene Ruspini (Currently at SRI)
Lotfi Zadeh (Berekley)
The important dates (currently) are:
Dec. 1984, Call for papers.
March 30th. Abstract/paper submittion deadline
April 20th. Notification of acceptances/rejections
May 24th. Submittion of camera ready copy
June 7th. All papers to publisher (Kaufmann)
August 14,15,16th. Workshop at UCLA (exact location to be determined)
Aug. 18th-23rd. IJCAI (UCLA)
The focus of this workshop is to explore the limitations,
advantages and alternatives to the use of probability as a general
method for representing and reasoning about uncertainty in AI. The
emphasis is on application and interpretation of probability and
uncertainty in concrete examples to avoid the difficulties of
discussion at too abstract a level (where there is confusion about
meaning of terms). Alternative methods for representing uncertain
will only be considered by their relationship (if any) to probability,
or their proported ability to solve problems that a probabilistic
approach cannot.
The proposed workshop framework is paper presentation with ample
time for presentation and discussion, plus some panel discussions on
specific topics yet to be determined. The workshop will be keep
small, the actual size will depend on the response, but probably about
50 people. Most participants will be by invitation, remaining places
being filled on a first come first served basis.
Thank you for your previous prompt reply, sorry I have not been able
to respond till now...
Peter Cheeseman
---------------
P.S. Are you interested in participating in this workshop yourself?
-------
∂30-Nov-84 2348 KROVETZ@SUMEX-AIM.ARPA technical reports
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 30 Nov 84 23:48:42 PST
Date: Fri 30 Nov 84 23:49:03-PST
From: Bob Krovetz <KROVETZ@SUMEX-AIM.ARPA>
Subject: technical reports
To: jmc@SU-AI.ARPA
Professor McCarthy,
Some time ago I made some inquiries about who could be contacted
for ordering tech reports via the net, and which sites maintained
online bibliographies. Diana Hall told me that a bibliography of
AI lab reports existed under [BIB,DOC]AIMLST. At the time I was
able to ftp this file, but since then the directory appears to
have been protected. On my primary machine (NLM-MCS, the National
Library of Medicine) I can get a listing of the directory, but I'm
unable to transfer any files. On SUMEX I can't even list the directory!
Is there anything you can do about this?
Thank you,
Bob Krovetz
-------
∂01-Dec-84 1019 BARWISE@SU-CSLI.ARPA IBM
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 1 Dec 84 10:19:20 PST
Date: Sat 1 Dec 84 10:19:02-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: IBM
To: Executives@SU-CSLI.ARPA
cc: Goguen@SRI-AI.ARPA, jmc@SU-AI.ARPA, tw@SU-AI.ARPA, nilsson@SRI-AI.ARPA
Brian, Joe and I had a good meeting with folks from IBM yesterday.
Initially we had one supporter and two sceptics, as I read it, with
John Backus the supporter. By the end of lunch, we had all three
thinking of ways to work within IBM to get support for CSLI. They
seemed a little dubious about the building, thinking that something
like 500K/year support, plus some people of theirs dedicated to the
project, was more what they could work for. The main question that
came up was how to win over one Joe Winograd, at Yorktown Heights,
since he is the person that Ralph Gomery (the IBM analogue of Pake)
would turn to for advice. Anyone know this Winograd?
Jon
-------
∂01-Dec-84 1713 BARWISE@SU-CSLI.ARPA re: IBM
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 1 Dec 84 17:13:22 PST
Date: Sat 1 Dec 84 17:13:01-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: re: IBM
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 1 Dec 84 11:20:00-PST
You are right, it was "Sam", not "Joe". Guess I am getting senile and
should take notes. Do you know him well? Think you could talk to him
about us?
-------
∂02-Dec-84 1343 @MIT-ML:DAVIS%MIT-OZ@MIT-MC Ought we to be in pictures?
Received: from MIT-ML.ARPA by SU-AI.ARPA with TCP; 2 Dec 84 13:43:23 PST
Date: Sun 2 Dec 84 16:43:17-EST
From: Randall Davis <DAVIS%MIT-OZ@MIT-MC.ARPA>
Subject: Ought we to be in pictures?
To: AAAI-OFFICE@SUMEX-AIM.ARPA
cc: Amarel@RUTGERS.ARPA, Bledsoe@UTEXAS-20.ARPA, Buchanan@SUMEX-AIM.ARPA,
Brachman@SRI-KL.ARPA, KRD%MIT-OZ@MIT-XX.ARPA, Engelmore@SUMEX-AIM.ARPA,
Lerman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA,
JMC@SU-AI.ARPA, Nilsson@SRI-AI.ARPA, Reddy@CMU-CS-A.ARPA,
Rich%MIT-OZ@MIT-XX.ARPA, Stan@SRI-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA,
Stefik@XEROX.ARPA, Tenenbaum@SRI-KL.ARPA, Walker@SRI-AI.ARPA,
Webber%upenn@UDEL-RELAY.ARPA, PHW@MIT-MC.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of Mon 26 Nov 84 21:03:30-EST
"Claudia, I believe that the existence of this film will be of obvious
value to the AAAI and that support by the AAAI would be appropriate."
This single sentence is the only one in a long message that addresses
the issue of AAAI's involvement. I think the issue is not that simple.
Presumably the argument is that widespread understanding of our field is
important. I agree with this and wholeheartedly wish the Stanford folks
(and anyone else) well in their effort. But I see very important dangers
in the proposed scheme for AAAI:
I think it's crucial that AAAI have
the OPTION to contribute money once the film is produced
the OPTION to put its name on this film in some fashion
CONTROL over exactly whether and how its name is cited
sole AUTHORITY to decide all of these questions.
The basic danger of course is that substandard films get produced and the
organization's (and the field's) credibility get reduced. Substandard can
mean many things, not only the obvious problem of low technical quality;
it can also mean a film that is little more than a piece of publicity for
the organization, a film that presents one view of the field as "the" view
of AI, etc. etc.
[This should not be taken as any comment on the Stanford group's proposal
or likely success; I'm sure they'll do fine. But we are deciding policy
here and have to be careful about the future.]
The only way I can see out of this problem is to have the organization
reserve the right to contribute and the right to endorse the film AFTER it
has seen the results.
And the basic difficulty with that is that AAAI will unavoidably get into
the business of rating films (shades of X, R, GP, etc.) or of suggesting
changes while it's in production ("What do we need to change in order to
ensure your endorsement?"). I think we should think carefully before
committing ourselves to that. I believe there's no other way: we can't let
the organization's name be used indiscriminately, so we can't avoid
judging.
And do we really want to get into that business? Who amongst us will
volunteer to be on the movie review board, with all of the likely hassles
that might mean ("How can you not endorse our movie; it's just as good as
that thing X put out...")
I've focused on the name issue here because I suspect the $5K is
unimportant. I'm sure Stanford (or anyone else) would find the last $5K if
they wanted to make a movie; it's the AAAI name (and implicit endorsement)
that is the central issue here.
I'd even be willing to have AAAI contribute money according to the criteria
given, on the grounds that NO mention be made of its name. That is, I find
easy to see how the organization can encourage such films with money, but
difficult to see any reasonable way for it to do so via its endorsement.
I am glad that Stanford wants to make the movie and would encourage other
groups to do the same. But I guess I can't find any reasonable way for
AAAI to get its name involved.
Randy
-------
∂02-Dec-84 2328 ENGELMORE@SUMEX-AIM.ARPA Re: Ought we to be in pictures?
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 2 Dec 84 23:28:28 PST
Date: Sun 2 Dec 84 23:25:41-PST
From: Bob Engelmore <ENGELMORE@SUMEX-AIM.ARPA>
Subject: Re: Ought we to be in pictures?
To: DAVIS%MIT-OZ@MIT-MC.ARPA, AAAI-OFFICE@SUMEX-AIM.ARPA
cc: Amarel@RUTGERS.ARPA, Bledsoe@UTEXAS-20.ARPA, Buchanan@SUMEX-AIM.ARPA,
Brachman@SRI-KL.ARPA, KRD%MIT-OZ@MIT-XX.ARPA, Lerman@SRI-KL.ARPA,
Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA, JMC@SU-AI.ARPA,
Nilsson@SRI-AI.ARPA, Reddy@CMU-CS-A.ARPA, Rich%MIT-OZ@MIT-XX.ARPA,
Stan@SRI-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA, Stefik@XEROX.ARPA,
Tenenbaum@SRI-KL.ARPA, Walker@SRI-AI.ARPA, Webber%upenn@UDEL-RELAY.ARPA,
PHW@MIT-MC.ARPA
In-Reply-To: Message from "Randall Davis <DAVIS%MIT-OZ@MIT-MC.ARPA>" of Sun 2 Dec 84 13:45:22-PST
Home Phone: (415) 322-0627
Office Phone: (415) 327-6600
Randy,
Your thoughtful message makes it clear that FUNDING a project and
ENDORSING it are two separate issues. I suspect that in nearly all
cases the decision to fund a project must be made before the project
is completed --in fact it's likely to be a prerequisite for starting
the project. Endorsement, however, is another matter and could come
later, or not at all. In fact, I suggest that AAAI not endorse any of
these film projects, just as ARPA or NSF does not endorse the research
that they support. A simple statement like "Funded in part by the
American Association for Artificial Intelligence" should be the only
credit on the film.
One way to get around the problem of variable quality is to fund a
fairly large number (say a dozen or so) of projects proposed by
respectable institutions. Some of these will probably be very good,
and we'd be proud to distribute them widely as films that the AAAI
helped to produce. Others will probably be turkeys, but we don't have
to advertise or distribute them. I think natural selection will
prevail here if we let enough flowers bloom.
I certainly agree with you that setting up a board of evaluators/
censors is unworkable, so if we're going to fund these projects at all
-- and I think we should -- we will have to live with the results. But
we don't have to endorse them.
Bob
-------
∂03-Dec-84 0004 ME Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 3 December 1984
Previous Balance 1.90
Monthly Interest at 1.5% 0.03
Current Charges 1.15 (vending machine)
-------
TOTAL AMOUNT DUE 3.08
Please deliver payments to Rutie Adler, room 358, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Bills are payable upon presentation. Interest of 1.5% per month will be
charged on balances remaining unpaid 25 days after bill date above.
Your last Pony payment was recorded on 10/13/84.
Accounts with balances remaining unpaid for more than 55 days are
considered delinquent and are subject to reduction of credit limit.
Please pay your bill and keep your account current.
∂03-Dec-84 0029 MADSEN@SU-CSLI.ARPA Workshop, Dec. 4
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 3 Dec 84 00:18:22 PST
Date: Mon 3 Dec 84 00:16:54-PST
From: Ole Lehrmann Madsen <MADSEN@SU-CSLI.ARPA>
Subject: Workshop, Dec. 4
To: WSMAILALL: ;
As of today all participants should have received a map showing the
route to the conference location.
Also all persons wanting a lift should have received a message about
whom to drive with.
If you have not received a map or a message about whom to drive with,
please contact me immediately. I will be in my office (MJH 241) the
whole of Monday, except 10:00-11:00p.m. and 12:00-1:15p.m.
My phone no. is 497 - 0364.
--Ole
-------
∂03-Dec-84 0926 TW
To: executives@SU-CSLI.ARPA, goguen@SRI-AI.ARPA,
nilsson@SRI-AI.ARPA, JMC@SU-AI.ARPA
I know a Sam Winograd at Yorktown (seems to be a common name there),
but maybe Joe will turn out to be a long lost cousin. I've never
heard of him before. --t
∂03-Dec-84 1000 JMC*
periodontist, Grove dict., Jim Adams
∂03-Dec-84 1000 JMC*
fateman
∂03-Dec-84 1035 RA mathew ginsberg
Did you agree to pay Mathew's trip to the AAAI Conference in August even though
he started working for HPP July 15?
∂03-Dec-84 1120 ATP.BLEDSOE@UTEXAS-20.ARPA Re: Ought we to be in pictures?
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 3 Dec 84 11:20:05 PST
Date: Mon 3 Dec 84 13:15:42-CST
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Re: Ought we to be in pictures?
To: ENGELMORE@SUMEX-AIM.ARPA, DAVIS%MIT-OZ@MIT-MC.ARPA,
AAAI-OFFICE@SUMEX-AIM.ARPA
cc: Amarel@RUTGERS.ARPA, Bledsoe@UTEXAS-20.ARPA, Buchanan@SUMEX-AIM.ARPA,
Brachman@SRI-KL.ARPA, KRD%MIT-OZ@MIT-XX.ARPA, Lerman@SRI-KL.ARPA,
Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA, JMC@SU-AI.ARPA,
Nilsson@SRI-AI.ARPA, Reddy@CMU-CS-A.ARPA, Rich%MIT-OZ@MIT-XX.ARPA,
Stan@SRI-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA, Stefik@XEROX.ARPA,
Tenenbaum@SRI-KL.ARPA, Walker@SRI-AI.ARPA, Webber%upenn@UDEL-RELAY.ARPA,
PHW@MIT-MC.ARPA, ATP.Bledsoe@UTEXAS-20.ARPA
In-Reply-To: Message from "Bob Engelmore <ENGELMORE@SUMEX-AIM.ARPA>" of Mon 3 Dec 84 01:26:48-CST
All,
I am impressed with your various responses, some of which are very
will thought out. I will still wait awhile before I comment until all of your
comments have been received and until I have discussed this with Claudia. Woody
-------
∂03-Dec-84 1139 GOLUB@SU-SCORE.ARPA AFIPS award
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 3 Dec 84 11:39:16 PST
Date: Mon 3 Dec 84 11:27:28-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: AFIPS award
To: faculty@SU-SCORE.ARPA
The chairman of the AFIPS education award committee is desperate for a
nomination for the AFIPS Education Award for 1985. The first two recipients
were Kemeny and Perlis. It's for innovative teaching, curriculum development
and leadership.
Any nominees?
GENE
-------
∂03-Dec-84 1245 RA mileage
Any idea how many mile round trip Livermore-PA?
I've been claiming the standard amount, and I guess it's 100 miles,
but I guess you better ask Dick Gabriel if you can't find it somewhere.
∂03-Dec-84 1339 GOLUB@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 3 Dec 84 13:39:14 PST
Date: Mon 3 Dec 84 13:32:11-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 3 Dec 84 11:43:00-PST
Good!
Would you like to complete the forms?
GENE
-------
∂03-Dec-84 1356 RA
It will be less time consuming to type this into a file, which file do
you want it in?
∂03-Dec-84 1414 RA malachi orals
Don't you have to be present to Malachi's orals at 2:15 today?
∂03-Dec-84 1441 RA
Richard Fateman (642 1879) called re visit to Berkely. He suggested
Friday, Dec. 14 in the morning. Please call him.
∂03-Dec-84 1513 NILSSON@SU-SCORE.ARPA Nonmon Chapter
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 3 Dec 84 15:13:05 PST
Date: Mon 3 Dec 84 15:10:09-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Nonmon Chapter
To: jmc@SU-SCORE.ARPA
cc: nilsson@SU-SCORE.ARPA
John, I'll be writing up another draft of our Nonmonotonic Reasoning
chapter sometime before Winter Quarter begins. I've received
several useful comments from Etherington and from some other folks, and
I want to incorporate some of these into the next draft. So, if you
still want to use these notes in your epistemology course, there will
be another version around the beginning of the year. -Nils
-------
∂03-Dec-84 1515 TAJNAI@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 3 Dec 84 15:15:39 PST
Date: Mon 3 Dec 84 15:12:59-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
To: Genesereth@SUMEX-AIM.ARPA, TW@SU-AI.ARPA, ZM@SU-AI.ARPA, JMC@SU-AI.ARPA,
CRC.EJM@SU-SIERRA.ARPA, JLH@SU-SHASTA.ARPA, M@SU-SIERRA.ARPA,
CLARK@SU-SHASTA.ARPA, WIEDERHOLD@SU-SCORE.ARPA, TOB@SU-AI.ARPA,
DCL@SU-AI.ARPA, ULLMAN@SU-SCORE.ARPA, YAO@SU-SCORE.ARPA,
OR.GILL@SU-SIERRA.ARPA, OLIGER@SU-NAVAJO.ARPA
This message has been sent to your student advisee(s) who are
scheduled to speak at the Feb. 13/14 meeting. I have tried to
arrange the schedule around YOUR teaching schedule. Please note
the session in which your advisee is scheduled. Also, please note
those professors who have been designated session chairmen.
@make(Memo,Phone "497-3550",department Forum, Logo Old,
who "Carolyn Tajnai", what "Manager", Where "ERL 446")
@to(Speakers for 17th Annual Computer Forum Meeting)
@from(Carolyn Tajnai)
@subject(Your talk)
@begin(body)
You have been nominated by your faculty advisor to present a
talk at the Forum Annual Meeting February 13/14, 1984
Plan on 20 minutes total to speak -- that includes 2 minutes for
your advisor to introduce you and to place your research into perspective
with the other research in his/her group; also time for questions.
20 minutes total.
BY MONDAY, DECEMBER 10
I need the title of your talk so a
preliminary program can be mailed to the Invitees. You can make
a change in the title later, but I must have a working title
by MONDAY, DECEMBER 10.
BY MONDAY, JANUARY 14:
Submit a short abstract and no more than 10 CLEAR Xerox copies of the
viewgraphs you plan to use during your talk so that they may be
compiled into a Viewgraph Booklet. IF YOU CHANGE YOUR VIEWGRAPHS, GIVE
ME NEW COPIES BY FRIDAY, FEBRUARY 8 SO AN ERRATA CAN BE PRINTED.
The title of your talk and your name should appear on the first viewgraph.
"Dry runs" of the presentations are strongly urged. Please check with
your Session Chairman for the time and place scheduled for your dry run.
You will each receive a written invitation to the Technical Sessions,
the two luncheons, and the banquet on Wednesday night. All meals are
without charge and are for Forum participants only. Student attendance
at meals must be limited to student speakers. You will be given a name
tag to wear.
Please, under no circumstances invite industrial visitors to attend
the Forum meeting. One of the speakers did one year and it caused
great embarrassment. The meeting is closed to all except Forum
members and they are invited by the Director of the Forum and the
Program Chairman. Non-Department random Stanford academic people may
be invited on a space available basis.
you are scheduled in the following sessions:
Wed., Feb. 13:
9:30 session: Mackinlay, Rosenschein (session chairman: Genesereth)
10:50 " Yue, Abadi, Moses (session chairman: McCarthy)
11:30 " Rosenbloom, Guibas (Reid)
1:30 " Wagner, Bozorgui-Nesbat, Hughes (McCluskey)
2:45 " Kenniston, Sarkar, Mitchell (Flynn)
4:00 " Demetrescu, Chapiro, Pednault (Wiederhold)
Thurs., Feb. 14:
9:05 " Marimont, Malik, Sarkar (Luckham)
10:25 " Kuper, Hochschild, Beigel, Feigenbaum (Yao)
2:00 " Foulser, Worley, Caruso (Oliger)
3:15 " Kornfeld, Keller, ? (?)
Chapiro, Marimont, Foulser need to tell me who will introduce them, if their
advisor cannot be present.
I will mail each of you a hardcopy of the preliminary program as soon
as it is available.
Carolyn
@end(body)
-------
-------
∂03-Dec-84 1606 LIBRARY@SU-SCORE.ARPA Math/CS Technical Reports File in Socrates or Separate File:Need Opinions
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 3 Dec 84 16:06:44 PST
Date: Mon 3 Dec 84 16:01:25-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Math/CS Technical Reports File in Socrates or Separate File:Need Opinions
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
Within the libraries, we are discussing how to add the technical reports infor-
mation to Socrates. There are two approaches: add the technical reports data
to the current Socrates Headings file or have a separate file just fo
technical reports but accessible through the same system. One of the concerns
in the library is the following: are users going to be overwhelmed with the
number of hits in the computer science area if the technical reports are
added to the headings file? Much of the concern is for the generalist who
may find the reports too technical for their needs. Some also feel that
researchers make a distinctions between the reports literature and the
published monographic literature and prefer to search these separately.
Do you feel this is accurate?
There are other issues involved but I think it would best to let you react
to the above and not overload with the details. Any comments and suggestions
on this topic will be very much appreciated.
Harry Llull
-------
∂03-Dec-84 1845 GARDNER@SUMEX-AIM.ARPA SRI
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 3 Dec 84 18:45:28 PST
Date: Mon 3 Dec 84 18:46:01-PST
From: Anne Gardner <GARDNER@SUMEX-AIM.ARPA>
Subject: SRI
To: jmc@SU-AI.ARPA
An update: I did talk to Stan Rosenschein last week, and I've now
delivered to him my dissertation and my resume. I guess the next step
is up to Stan and you.
--Anne
-------
∂03-Dec-84 1851 SMC Dinner?
Dinner at some point?
∂03-Dec-84 1900 YOM*
I am giving the CS Colloquium tomorrow at 4:15. -yom
∂03-Dec-84 2239 cheriton@Pescadero SUN workstations again.
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 3 Dec 84 22:39:29 PST
Date: Mon, 3 Dec 84 22:39:15 pst
From: David Cheriton <cheriton@Pescadero>
Subject: SUN workstations again.
To: csdfacilities@Pescadero
1) Cost per SUN workstation is $9380. Gene Golub asked that we add
floating point hardware but that raise the price for each by
$2625 (even with discounts). I am proposing we get 10 with 3
equiped with floating point hardware for a total cost of
$101,675.
2) I am failing to get anywhere with board exchange credits. Looks
like the best approach is to simply reserve some money for maintenance.
If the Dean will pay 1/3, the capital cost is $67776 or so to dept.
leaving about $8K for maintenance. I havent been able even to get
exact board exchange prices for model 50s, but a reasonable estimate
is about $500, so $8k would cover maybe 16 board swaps, power supply
failures, etc. This seems adequate to me, especially given our excellent
experience with SUNs once past warranty period and infant mortality.
3) I am told we are working with a hard deadline of Dec. 31/84 with
the 30 percent discount. Aftewards, discount goes to 15 percent,
roughly costing us one workstation plus putting us further back in
the order queue.
So, does anyone object to the formula of $67K on equipment and $8K
reserved for maintenance? I.e. can I regard this as a committee
decision to go with this?
∂04-Dec-84 0924 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA f4 meeting reminder
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 4 Dec 84 09:24:38 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Tue 4 Dec 84 09:22:49-PST
Date: Tue 4 Dec 84 09:22:28-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: f4 meeting reminder
To: f4@SU-CSLI.ARPA
!
---------------
Return-Path: <@SU-SCORE.ARPA:BMOORE@SRI-AI.ARPA>
Received: from SU-SCORE.ARPA by SRI-AI.ARPA with TCP; Thu 29 Nov 84 17:25:21-PST
Received: from SU-CSLI.ARPA by SU-SCORE.ARPA with TCP; Thu 29 Nov 84 17:09:24-PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Thu 29 Nov 84 17:10:02-PST
Date: Thu 29 Nov 84 17:09:37-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: next F4 meeting
To: f4@SU-CSLI.ARPA
cc: ingrid@SU-CSLI.ARPA
The next F4 meeting will be Tuesday, Dec. 4, at 3:15 in the Ventura
conference room. We will discuss the last three chapters of the
Harman ms. Please be thinking of specific suggestions for what to do
next.
--Bob
-------
-------
∂04-Dec-84 1057 RA
Inference invoice on your desk to be signed.
∂04-Dec-84 1132 PETERS@SU-CSLI.ARPA Re: IBM
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 4 Dec 84 11:32:50 PST
Date: Tue 4 Dec 84 11:31:32-PST
From: Stanley Peters <PETERS@SU-CSLI.ARPA>
Subject: Re: IBM
To: BARWISE@SU-CSLI.ARPA
cc: Executives@SU-CSLI.ARPA, Goguen@SRI-AI.ARPA, jmc@SU-AI.ARPA, tw@SU-AI.ARPA,
nilsson@SRI-AI.ARPA
In-Reply-To: Message from "Jon Barwise <BARWISE@SU-CSLI.ARPA>" of Sat 1 Dec 84 10:19:06-PST
I've asked around, and can't find anyone who knows a Joe Winograd
at Yorktown Heights either. Are you sure it's not Sam (Shmuel)
Winograd?
-------
∂04-Dec-84 1220 RA LA trip 12/5
You are booked on PSA 164, depart San jose 8:30 arr. LA 9:31. Your return flight
is PSA 465, depart LA 4:00, arrive SJ 4:57. The tickets will be dlivered this
afternoon.
∂04-Dec-84 1444 RA
Richard Schroeppel called to let you know that they are going to hold the
meeting on January 11. He says you know which meeting it is.
∂04-Dec-84 1603 LGD Stoyan book
I am negotiating with Herbert Stoyan a possible translation of his history
of lisp. He mentions that you have a copy of the book which I might be able
to borrow. It is 'LISP Grundbegriffe, Anwendungsgebiete, Geschichte.'
Could I arrange to pick it up from you or your secretary?
Thanks,
Linda
∂04-Dec-84 1416 RA tickets
The tickets are on you desk.
∂04-Dec-84 2051 TAJNAI@SU-SCORE.ARPA faculty liaison
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Dec 84 20:51:44 PST
Date: Tue 4 Dec 84 14:43:34-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: faculty liaison
To: jmc@SU-AI.ARPA
John, EG&G Idaho plans to join the Forum the first of January and
they have requested you for a faculty liaison. You have not served
in that capacity for the Forum, and I'm not sure how you feel about it.
Would you be interested? Bill Bertch is the gentleman who called.
Duties of a liaison:
Visit one day a year
Technical contact (within reason)
your secretary would assist in setting up recruiting appointments with
students.
Your secretary would assist in setting up appointments if people from
EG&G visit the campus (again within reason -- once or twice a year).
It would be wonderful to have you participate more actively in the Forum.
Carolyn
-------
∂04-Dec-84 2125 FISHER@SU-SCORE.ARPA BRS-Shared Instrumentaion Grant (SIG) Program
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Dec 84 21:25:32 PST
Date: Tue 4 Dec 84 15:59:40-PST
From: Norine Fisher <FISHER@SU-SCORE.ARPA>
Subject: BRS-Shared Instrumentaion Grant (SIG) Program
To: faculty@SU-SCORE.ARPA
Those faculty members who are interested in applying for grants under
the above-mentioned program are invited to ask me for a copy of the
application information.
"BRS Shared Instrumentation Grants provide support for expensive
state-of-the-art instruments utilized in both basic and clinical
research. Applications are limited to instruments that cost at least
$100,000 per instrument or system. Types of instrumentation support
include, but are not limited to, nuclear magnetic resonance systems,
electron microscopes, mass spectrometers, protein sequencer/amino acid
analyzers and cell sorters. Support will not be provided for general
purpose equipment or purely instructional equipment. Proposals for
"stand alone" computer systems will only be considered if the
instrument is solely dedicated to the research needs of a broad
community of NIH-supported investigators."
-------
∂05-Dec-84 0018 GLB
I apologize: I slept through the class today (worked all night yesterday).
∂05-Dec-84 0759 TAJNAI@SU-SCORE.ARPA re: faculty liaison
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Dec 84 07:59:20 PST
Date: Wed 5 Dec 84 07:58:10-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: re: faculty liaison
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 4 Dec 84 21:36:00-PST
Idaho Falls
-------
∂05-Dec-84 0945 SHORTLIFFE@SUMEX-AIM.ARPA Re: Ought we to be in pictures?
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 5 Dec 84 09:44:53 PST
Date: Wed 5 Dec 84 09:44:56-PST
From: Ted Shortliffe <Shortliffe@SUMEX-AIM.ARPA>
Subject: Re: Ought we to be in pictures?
To: ATP.Bledsoe@UTEXAS-20.ARPA
cc: ENGELMORE@SUMEX-AIM.ARPA, DAVIS%MIT-OZ@MIT-MC.ARPA,
AAAI-OFFICE@SUMEX-AIM.ARPA, Amarel@RUTGERS.ARPA, Bledsoe@UTEXAS-20.ARPA,
Buchanan@SUMEX-AIM.ARPA, Brachman@SRI-KL.ARPA, KRD%MIT-OZ@MIT-XX.ARPA,
Lerman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA,
JMC@SU-AI.ARPA, Nilsson@SRI-AI.ARPA, Reddy@CMU-CS-A.ARPA,
Rich%MIT-OZ@MIT-XX.ARPA, Stan@SRI-AI.ARPA, Stefik@XEROX.ARPA,
Tenenbaum@SRI-KL.ARPA, Walker@SRI-AI.ARPA, Webber%upenn@UDEL-RELAY.ARPA,
PHW@MIT-MC.ARPA
In-Reply-To: Message from "Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>" of Mon 3 Dec 84 11:18:10-PST
Office: Room TC-135, Stanford Med Center; Phone: (415) 497-6979
Woody,
My membership in the HPP prevents me from taking a position on this
specific request, but with regards to the AAAI policy issue, I believe that
Bob Engelmore has the right model. The usual approach is to review a proposal,
rule on its potential merit, and to request a simple acknowledgement of AAAI
support in the final product. There is no implied endorsement per se. So
long as there are criteria for reviewing proposals (and it appears that these
have already been thought out reasonably well), I see minimal risk to having
the AAAI involved with this kind of support.
Ted
-------
∂05-Dec-84 0958 SMC phone message
call Jack Kate
∂05-Dec-84 1056 RA CS206-Tom Geffel
Tom Geffel in CS206 wants an incomplete grade.
∂05-Dec-84 1114 JDLH@SU-SCORE.ARPA Re: SUN workstations
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 5 Dec 84 11:14:00 PST
Received: from SU-SCORE.ARPA by Pescadero with TCP; Wed, 5 Dec 84 11:11:53 pst
Date: Sun 2 Dec 84 22:02:53-PST
From: Jim DeLaHunt <JDLH@SU-SCORE.ARPA>
Subject: Re: SUN workstations
To: csdfacilities@SU-PESCADERO.ARPA
Cc: JDLH@SU-SCORE.ARPA
In-Reply-To: Message from "David Cheriton <cheriton@Pescadero>" of Fri 30 Nov 84 11:22:22-PST
I like David's plan as well. Well done!
--Jim DeLaHunt JDLH @ Score 497-0644 (415) 327-JDLH
-------
∂05-Dec-84 1152 KUO (on TTY63, at TV-132 1152)
May I talk with you for about 15 minutes sometimes this afternoon after 2:30?
∂05-Dec-84 1158 DAC
Dear John Patrickovich: My trip was useful. Kahn was nice, we had good professionao
nal conversation. He suggested some alternative approaches, such as funding
of a few concrete projects to prove that the thing will work. Many thanks, I
will call you later. DAVID.
∂05-Dec-84 1236 RTC CS206 Course Evaluations
We need to allow 10 minutes at the beginning of class on
Thursday for the students to do the course evaluation.
I have the forms.
Ross.
∂05-Dec-84 1425 DIEP@SU-SCORE.ARPA Final
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Dec 84 14:25:47 PST
Date: Wed 5 Dec 84 14:23:57-PST
From: Diep Tran Dinh Le <DIEP@SU-SCORE.ARPA>
Subject: Final
To: McCarthy@SU-SCORE.ARPA
I am leaving next week and would like to take the final earlier .
Let me know if that would be possible, and if so, when I can take it.
Thanks a lot.
Lan
-------
∂05-Dec-84 1630 BARWISE@SU-CSLI.ARPA Kennedy and Drell
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 5 Dec 84 16:30:07 PST
Date: Wed 5 Dec 84 16:25:25-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Kennedy and Drell
To: Research@SU-CSLI.ARPA
Remember that Kennedy and Drell are coming to talk with us tomorrow
about possible military funding of CSLI research. Kennedy called
Etchemendy to make sure this was a csli event, not a large public
event. Since it is a regular colloquium, it is open, but we want to
keep it a CSLI event. Thus I would urge you to come but not to bring
non-CSLI folks. I would also suggest that you go to Redwood a bit
early, so that if there is not room for everyone, it will be CSLI
folks who are there.
-------
∂05-Dec-84 1635 @SRI-AI.ARPA:BARWISE@SU-CSLI.ARPA Sam, not Joe, Winograd
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 5 Dec 84 16:35:26 PST
Received: from SU-CSLI.ARPA by SRI-AI.ARPA with TCP; Wed 5 Dec 84 16:35:50-PST
Date: Wed 5 Dec 84 16:33:57-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Sam, not Joe, Winograd
To: TW@SU-AI.ARPA, Executives@SU-CSLI.ARPA, Goguen@SRI-AI.ARPA,
Nilsson@SRI-AI.ARPA, JMC@SRI-AI.ARPA
As several people have pointed out to me, it is Sam, not Joe, Winograd
that IBM Yorktown. Now the question is does anyone know him well
enough to talk to him about CSLI?
-------
∂05-Dec-84 1659 RA Chudnovsky
David called, wanted to tell you that he had a good meeting in Washington.
∂05-Dec-84 1721 TAJNAI@SU-SCORE.ARPA Need your opinion
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Dec 84 17:21:37 PST
Date: Wed 5 Dec 84 17:18:31-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: Need your opinion
To: faculty@SU-SCORE.ARPA, csl-faculty@SU-SIERRA.ARPA
I am having serious problems scheduling the Forum for this year. We
still have CERAS as a backup, but we need a larger room. I thought I
had Kresge Auditorium, but classes have been scheduled and we have been
"bumped". The problem has arisen because of the rapid growth of the
Forum -- we will have at least 65 companies by the Feb. meeting.
The Conference Office has suggested two alternatives for 1986 ->
1. Hold the annual meeting during spring break.
2. Hold the annual meeting on a weekend.
I have not queried the students yet, would like your opinions first.
Holding it off-campus is also a possibility.
?????
Carolyn
-------
∂05-Dec-84 1912 NILSSON@SRI-AI.ARPA Re: Sam, not Joe, Winograd
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 5 Dec 84 19:12:12 PST
Date: Wed 5 Dec 84 19:12:07-PST
From: NILSSON@SRI-AI.ARPA
Subject: Re: Sam, not Joe, Winograd
To: BARWISE@SU-CSLI.ARPA
cc: TW@SU-AI.ARPA, Executives@SU-CSLI.ARPA, Goguen@SRI-AI.ARPA, JMC@SRI-AI.ARPA,
NILSSON@SRI-AI.ARPA
In-Reply-To: Message from "Jon Barwise <BARWISE@SU-CSLI.ARPA>" of Wed 5 Dec 84 16:35:53-PST
I met Sam Winograd for the first time at a meeting in New York last
month. We didn't talk to each other very much, but he probably
remembers me. If no one steps forward with a stronger connection,
I'd be glad to talk to him about CSLI (after Jan. 1--I'm leaving
this Sat. for two weeks). -Nils
-------
∂05-Dec-84 2151 @SU-SCORE.ARPA:ullman@diablo Re: Need your opinion
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Dec 84 21:51:34 PST
Received: from diablo.ARPA (SU-AIMVAX.ARPA.#Internet) by SU-SCORE.ARPA with TCP; Wed 5 Dec 84 21:48:27-PST
Date: Wed, 5 Dec 84 21:50:51 pst
From: Jeff Ullman <ullman@diablo>
Subject: Re: Need your opinion
To: TAJNAI@SU-Score, csl-faculty@SU-SIERRA.ARPA, faculty@SU-Score
weekend: bad idea
spring break: probably too late for hiring.
Why don't we get a few more companies and hold it in Stanford stadium?
∂06-Dec-84 0851 LEIB@SU-SCORE.ARPA Re: The L.A. Times is getting too big, and actresses' dogs are getting too small.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Dec 84 08:51:08 PST
Date: Thu 6 Dec 84 08:49:57-PST
From: Rita Leibovitz <LEIB@SU-SCORE.ARPA>
Subject: Re: The L.A. Times is getting too big, and actresses' dogs are getting too small.
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 5 Dec 84 20:22:00-PST
Stanford-Phone: (415) 497-4223
John, I LOVE your sense of humor!
-------
∂06-Dec-84 1226 REGES@SU-SCORE.ARPA TA for 224
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Dec 84 12:26:29 PST
Date: Thu 6 Dec 84 12:25:05-PST
From: Stuart Reges <REGES@SU-SCORE.ARPA>
Subject: TA for 224
To: jmc@SU-AI.ARPA
Office: Margaret Jacks 210, 497-9798
I remember that we made some kind of deal at the beginning of this quarter where
you would get a 50% TA for 224 next quarter. Correct? Could you remind me of
who the TA should be so that I can process paperwork?
-------
∂06-Dec-84 1228 REGES@SU-SCORE.ARPA correction
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Dec 84 12:28:29 PST
Date: Thu 6 Dec 84 12:26:06-PST
From: Stuart Reges <REGES@SU-SCORE.ARPA>
Subject: correction
To: jmc@SU-AI.ARPA
Office: Margaret Jacks 210, 497-9798
I meant 226, not 224.
-------
∂06-Dec-84 1249 OHLANDER@USC-ISI.ARPA Research summary
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 6 Dec 84 12:49:30 PST
Date: 6 Dec 1984 15:48-EST
Sender: OHLANDER@USC-ISI.ARPA
Subject: Research summary
Subject: [BAUMAN@USC-ISI.ARPA: Initial Net Letter]
From: OHLANDER@USC-ISI.ARPA
To: JMC@SU-AI.ARPA
Message-ID: <[USC-ISI.ARPA] 6-Dec-84 15:48:32.OHLANDER>
John,
The format needed for the summary that we need follows.
Ron
Begin forwarded message
Received: By USC-ISI.ARPA via direct-append with Hermes; 5 Dec 84 13:19:40-EST
Date: 5 Dec 1984 13:19-EST
From: BAUMAN@USC-ISI.ARPA
To: ohlander@USC-ISI.ARPA, sears@USC-ISI.ARPA
Cc: bauman@USC-ISI.ARPA
Subject: Initial Net Letter
Message-ID: <[USC-ISI.ARPA] 5-Dec-84 13:19:38.BAUMAN>
Sender: BAUMAN@USC-ISI.ARPA
I am starting a project to develop and print a summary of the
Intelligent Systems Program at DARPA. Many people have asked
about various parts of the program and I believe an overview
publication will be useful. I plan to structure the document with
two sections. In the first, I will outline the basic mission of
DARPA and the objectives of the Intelligent Systems Program.
In the second, I would like to include summaries of the work
being done in Intelligent Systems that is funded by DARPA.
This is where I need your help. To make this a top quality
product, I am asking you to submit a brief 3-4 page summary
of your research efforts which I will include in the report.
Below I am presenting the details to provide a structure for
your input. I would like you to provide both text material and
graphics. We will handle the layout and type setting of the
publication so it is uniform. Upon completion, I will send
you a copy of the finished report, and extra copies will also
be available upon request.
Research Summary Format
Constraints: 1) Length -- 700 to 1000 words of text (2-3 pages)
2) No more than 2 Visuals (diagrams, pictures, etc.)
with area 4-1/2" X 4-1/2" maximum
Format:
: Overview
: Objectives
: Approach
: Current Status
: Future Plans
: Resources and Participants
: Products, Demonstrable Results, Contact Points
What tools or products can be shared?
What can be (was) demonstrated?
Who is the future point of contact?
Please have your inputs returned to Mr. Lee Baumann at Science
Applications International Corporation (SAIC, 1710 Goodridge
Drive, 10th Floor, McLean, Virginia, 22102, Phone: (703) 734-4092,
(BAUMAN at USC-ISI.ARPA), by 15 October 1984. I also ask you to
contact Lee as soon as possible to advise him that you have received
this letter and whether or not you will be able to meet this
request by the above date. Any questions or problems should also
be directed to Lee.
You are the best researchers in the country. This is a
great opportunity to share your ideas, methods, and findings with others.
I am sure that your research summary will reflect the outstanding
quality of your work.
Regards,
Ron Ohlander
--------------------
End forwarded message
∂06-Dec-84 1316 @SU-SCORE.ARPA:KARP@SUMEX-AIM.ARPA TGIF
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Dec 84 13:16:30 PST
Received: from SUMEX-AIM.ARPA by SU-SCORE.ARPA with TCP; Thu 6 Dec 84 13:04:40-PST
Date: Thu 6 Dec 84 13:06:59-PST
From: Peter Karp <KARP@SUMEX-AIM.ARPA>
Subject: TGIF
To: students@SU-SCORE.ARPA, faculty@SU-SCORE.ARPA
cc: KARP@SUMEX-AIM.ARPA
This weeks TGIF is cancelled because Ramsey and I will not be here to
set it up. There will thus be no more TGIFs this quarter.
Peter
-------
∂06-Dec-84 1342 LIBRARY@SU-SCORE.ARPA Math/CS Library New Books
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Dec 84 13:42:32 PST
Date: Thu 6 Dec 84 13:37:47-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Math/CS Library New Books
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
Tutorial Microcomputer Networks by Freeman and Thurber TK5105.5T894
The Development of Combinatorics in the USSR (A Brief Historical and
Mathematical Survey) by Goldberg QA164.G64 1983
Methods of Numerical Mathematics by Marchuk QA297.M3413 1982
Applied Combinatorics 2nd ed. by Tucker QA164.T83 1984
Mathematical Foundations of Computer Science 1984 Proceedings QA76.9M35M38 1984
Principles of Text Processing by Teskey P302.T34 1982
Design and Strategy for distributed Data Processing by
-------
∂06-Dec-84 1352 LIBRARY@SU-SCORE.ARPA Math/CS Library New Books --continued
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Dec 84 13:52:21 PST
Date: Thu 6 Dec 84 13:43:58-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Math/CS Library New Books --continued
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
Design and Strategy for Distributed Data Processing by Martin QA76.9.D5M386
The Human Interface Where People and Computers Meet by Bolt QA76.9I58B65 1984
Computer Message Systems by Vallee TK5105.V35 1984
Research Needed to Advance the State of Knowledge in Robotics. Workshop
Rhode Island April 15-17, 1980 TS191.8W67 1980
Harry Llull
-------
∂06-Dec-84 1411 REGES@SU-SCORE.ARPA Senior Survey: Computers
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Dec 84 14:11:28 PST
Date: Thu 6 Dec 84 13:57:45-PST
From: Stuart Reges <REGES@SU-SCORE.ARPA>
Subject: Senior Survey: Computers
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA, bboard%LOTS-A@SU-SCORE.ARPA, street@SU-SCORE.ARPA
Office: Margaret Jacks 210, 497-9798
If you read the report on last year's Senior Survey in either The Stanford
Daily or The Campus Report you will find that one of the items is not discussed
much. One of the abilities students were asked to rate is "Make use of
computers." Over half of the students rated their ability Good or Excellent.
This skill was also highly valued by the students with 25% rating the
importance "Very Great" and 36% rating it "Great". This skill was considered
more important, for example, than understanding math, natural sciences or
literature and fine arts. The most interesting point about this question,
however, has to do with degree of improvement since entering Stanford. 35%
reported that they were "Much Better" and 28% reported that they were "Better"
since entering Stanford. This degree of improvement was greater than in any
other academic area in the survey. For example, even though students rated
writing higher than anything else (both in ability and importance), they do
not report much improvement since entering Stanford (8% say "Much Better" and
29% say "Better").
Somehow between CSD, EE, LOTS, etc., we seem to be producing students who feel
they have learned something that is important to them. I think we should all
be proud (and should ask the University for more money to keep it up!)
-------
∂06-Dec-84 1412 RA invoice inference
does your inference invoice go to any person in particular?
∂06-Dec-84 1433 REGES@SU-SCORE.ARPA re: TA for 224
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Dec 84 14:32:56 PST
Date: Thu 6 Dec 84 14:26:14-PST
From: Stuart Reges <REGES@SU-SCORE.ARPA>
Subject: re: TA for 224
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 6 Dec 84 14:06:00-PST
Office: Margaret Jacks 210, 497-9798
Could you ask Gian-Luigi to come in and fill out the "TA/RA Information Sheet"
(available at the Receptionist Desk)? We need some information about address,
social security number, etc., to process the paperwork.
-------
∂06-Dec-84 1441 HULLMAN@SU-SCORE.ARPA party
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Dec 84 14:41:00 PST
Date: Thu 6 Dec 84 14:37:40-PST
From: Holly Ullman <HULLMAN@SU-SCORE.ARPA>
Subject: party
To: faculty@SU-SCORE.ARPA
On Fri., Dec. 21, at 6:30, the Wiederholds and the Ullmans are
co-hosting a buffet dinner in honor of Gene at the end of his
term as chairman. It will be held at the Ullmans, 1023 Cathcart
Way (on campus). We hope you can join us.
R.S.V.P. only if you're planning to come - and please let us
know if a spouse or date is coming as well.
Holly
-------
∂06-Dec-84 1542 gefell@Navajo cs206
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 6 Dec 84 15:41:44 PST
Date: Thu, 6 Dec 84 15:40:18 pst
From: Tom Gefell <gefell@Navajo>
Subject: cs206
To: jmc@su-ai
Bad connection there. I over-booked myself by trying to take 2
classes and work. That's my mistake but I'd like you to let me
not have to pay for it.
The schedule was complicated when my job move 15 miles away and
we switched projects.
Basically I over-booked my time and unforseen changes at work have
left me far behind in my classes. Please give me a grade of
incomplete for CS206.
Thanks, Tom Gefell.
∂06-Dec-84 1713 LIBRARY@SU-SCORE.ARPA Computational Intelligence--New Journal
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Dec 84 17:13:12 PST
Date: Thu 6 Dec 84 16:58:08-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Computational Intelligence--New Journal
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA, ailist@SRI-KL.ARPA
Computational Intellignece/Intelligence Informatique is a new journal which
will publish in English/French high-quality original theoretical or
experimental research in computational (aritificial) intelligence. The
editors are Nick Cercone/Simon Fraser University and Gordon McCalla/Univer.
of Saskatchewan. Editorial board includes L. Bolc, A. Mackworth, A. Ortony,
R. Perrault, E. Sandewall, A. Sloman, n. Sridharan, D. Wilkins etc.
Subscription rates: U.S. $85 institutional, $47 personal. It will be
a quarterly with the first issue to be available February 1985.
It will be published by the National Research Council of Canada and
sponsored by the Canadian Society for Computational studies of intelligence.
For more information: Distribution, R-88 (Computational Intelligence),
National Research Council of Canada, Ottawa, Ontario, Canada, K1A OR6.
Special rates for members of Canadian Societies. Manuscripts should be
addressed to the editors, Computational Intelligence, Computing Science
Department, Simon Fraser University, Burnaby, British Columbia, Canada,
V5A 1S6.
I will be ordering this title for the Math/CS Library. Members of the
Stanford community who want to be notified when we receive this title
should send me a message.
Harry Llull
-------
∂06-Dec-84 1815 RTC CS206 exam
Geoff Ralston, a TV student at Hewlett Packard cannot make it to the
exam on Thursday night. He would prefer to do it on Tuesday, he says.
What can we do for him?
Ross
∂06-Dec-84 1847 RTC re: CS206 exam
Do you know what limits there are on how late we can give him the
exam? I mean, isn't there a final date for grades to be submitted?
Ross.
∂06-Dec-84 2103 BACH@SU-SCORE.ARPA Re: The L.A. Times is getting too big, and actresses' dogs are getting too small.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Dec 84 21:03:15 PST
Date: Thu 6 Dec 84 21:01:40-PST
From: Rene Bach <BACH@SU-SCORE.ARPA>
Subject: Re: The L.A. Times is getting too big, and actresses' dogs are getting too small.
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 5 Dec 84 20:22:00-PST
The defense said the Newspaper carrier acted in self-defense.
(:-)
-------
∂06-Dec-84 2111 JK
This was the message from Betty Scott:
A Dr. Wallace at NSF would tell us very little except that the proposal is
still being reviewed. He said he would be glad to talk with John about it
if he wishes to call. The number is (202) 357-6558.
Betty
-------
So it seems that this guy might want to be influenced.
Talking about other matters, I have been thinking about changing
EKL to handle more combinator-like and type-free constructions
to do function definitions and the like.
This would be in the way of a direct generalization of the
current language of EKL with the following features:
(1) Expressions like λx.¬x(x) are perfectly legal --- there is no
syntactic type checking in the current sense. How do we avoid
contradictions? It seems to me that the only serious problem
occurs in λ-elimination: there EKL has to prove on the basis
of the information available that the λ-elimination is permissible.
(2) All types are gone. Instead we have sorts --- that is to say unary
predicates inheriting some of the functions of types. For example,
λ-eliminations can be done only if we can prove something about
sorts.
Actually, I might end up calling these things types again. Nicer name.
(3) Implicit tuple splicing operations like (x y z (a b c))→→(x y z a b c)
will be eliminated. Instead, there will be an explicit splicing operation
called @ as in Common Lisp: (x @(u v w) a) →→ (x u v w a)
(4) All the functions are regarded as having an arbitrary number of arguments.
As I said, I need to think this over again to convince myself of its
consistency. I might also add more meta theoretic facilities at the same
time.
∂07-Dec-84 0201 FOGELSONG@SU-SCORE.ARPA A.J. Thomas
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Dec 84 02:00:55 PST
Date: Fri 7 Dec 84 01:59:04-PST
From: David Fogelsong <FOGELSONG@SU-SCORE.ARPA>
Subject: A.J. Thomas
To: jmc@SU-AI.ARPA
You were the principal advisor for A.J. Thomas. I recently
read his dissertion entitled "Representation and Perception: An essay on
computational metaphysics."
Could you tell me where he is now, and what he is doing?
--David
-------
∂07-Dec-84 0859 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Course announcement
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 7 Dec 84 08:59:48 PST
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Fri 7 Dec 84 08:58:40-PST
Date: 07 Dec 84 0845 PST
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: Course announcement
To: su-bboards@SU-AI.ARPA, "@DIS.DIS[1,CLT]"@SU-AI.ARPA
SETS AND PROCESSES
------------------
MATH 294 (PHIL 394) WINTER QUARTER.
COURSE ANOUNCEMENT
provisional time: Fridays, 1.15---3.15.
The standard universe of well-founded sets can be completed in a
natural way so as to incorporate every possible non-well-founded set.
The new completed universe will still model all the axioms of set
theory except that the foundation axiom must be replaced by an
anti-foundation axiom. The first part of the course will be concerned
with this new axiom, its model and its consequences. Several
interesting variants of the axiom will also be examined.
The second part of the course will be concerned with an axiomatic
approach to a general notion of abstract sequential process. These
processes are capable of interacting with each other so that a variety
of operations for their parallel composition will be available. The
notion is intended to form the foundation for an approach to the
semantics of programming languages involving concurrency. A model for
the axiom system can be extracted from recent work of Robin Milner.
But by using the anti- foundation axiom a simple purely set theoretic
model will be given.
Some familiarity with the axiomatic theory of sets and classes will be
presupposed. An understanding of the notion of a class model of ZFC
will be needed. Definition by recursion on a well-founded relation
and Mostowski's collapsing lemma will be relevent. But topics such as
the constructible universe, forcing or large cardinals will NOT be
needed. Some familiarity with computation theory would be useful.
Underlying the model constructions in both parts of the course is a
general result whose apreciation will require some familiarity with
the elements of universal algebra and category theory.
Background references will be available at the start of the course.
Auditors are very welcome. The course may be of interest to both
mathematicians and computer scientists.
PETER ACZEL
∂07-Dec-84 1307 FOGELSONG@SU-SCORE.ARPA re: A.J. Thomas
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Dec 84 13:07:17 PST
Date: Fri 7 Dec 84 13:03:42-PST
From: David Fogelsong <FOGELSONG@SU-SCORE.ARPA>
Subject: re: A.J. Thomas
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 7 Dec 84 09:37:00-PST
Thanks for the pointer to AAAI or AISB. I'll try to look him
up. If your memory of him returns, please relay your thoughts to this
address. Thanks.
--David
-------
∂07-Dec-84 1340 AAAI-OFFICE@SUMEX-AIM.ARPA Kowalik-Couping Symbolic & Numerical Computing in Expert Systems
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 7 Dec 84 13:40:55 PST
Date: Fri 7 Dec 84 13:42:11-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Kowalik-Couping Symbolic & Numerical Computing in Expert Systems
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
Have you had the time to review the Call for Participation for the
above mentioned workshop? If you have any changes with the text,
can you tell so that we can incorporate those changes and
send the Call to the members.
Thanks,
Claudia
-------
∂07-Dec-84 1359 gefell@Navajo cs206
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 7 Dec 84 13:59:22 PST
Date: Fri, 7 Dec 84 13:57:57 pst
From: Tom Gefell <gefell@Navajo>
Subject: cs206
To: jmc@su-ai
Sorry to bother you again. In case you didn't get my first message
(I was dumped mid-way through), here it is:
I'm Tom Gefell. I'd like an incomplete in CS206.
Semi-extenuating circumstances put me well behind (I was transferred to
Cupertino and re-assigned to a new project). I've been busy getting
that started and haven't been able to catch up. Since I am still busy
it is unlikely that I will be able to catch up during dead week.
Unfortunately I do not have the option of dropping the class since I'm
taking it over TV. Besides, I do not want to drop it, I just want more
time to be able to complete the work without failing.
Thanks.
I'm at gefell@navajo
or 408-725-8111 x3428.
∂07-Dec-84 1439 RTC Late exams
I just want to clarify what options this guy who can't make
it to the exam has.
Does he need to do the exam (and have it graded) before noon on
the monday grades must be submitted, or are you able to give him
an incomplete (or something) so that he has more flexibility?
I understand that he can't make it easily on the friday either,
because if he could, he wouldn't have asked to do it early.
Ross.
∂07-Dec-84 1514 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA future meetings
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 7 Dec 84 15:14:36 PST 01-08 F4
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Fri 7 Dec 84 15:13:35-PST
Date: Fri 7 Dec 84 15:13:10-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: future meetings
To: f4@SU-CSLI.ARPA
At our next meeting, Kurt Konolige will give a report on what has been
done in AI on belief revision. After that, we will turn more towards
planning and practical reasoning, perhaps getting into high level
specification for robot design.
Our next meeting will be in January. The default will be to pick up
on January 8, the first day of Stanford classes. Please let me know,
however, if there are any new scheduling conflicts next term that need
to be taken into account.
--Bob
-------
∂07-Dec-84 1646 JJW SAIL account for Joe Halpern
To: Gotelli@SU-SCORE.ARPA, ME@SU-AI.ARPA, JMC@SU-AI.ARPA
I've created the SAIL account JYH for Joe Halpern. (He needed it right
away since he's working on a paper with Yoram Moses.) He will get a copy
of the CSD-CF account form and return it as soon as he finds out which
university account he should be charged to.
∂07-Dec-84 1657 RA
MAD invoice on your desk.
Have a nice weekend!
∂07-Dec-84 1738 @SU-CSLI.ARPA:withgott.pa@Xerox.ARPA Research summary for the last meeting of the Fall Quarter
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 7 Dec 84 17:38:13 PST
Received: from Xerox.ARPA by SU-CSLI.ARPA with TCP; Fri 7 Dec 84 17:38:02-PST
Received: from Tokay.ms by ArpaGateway.ms ; 07 DEC 84 17:28:01 PST
Date: 7 Dec 84 16:51 PST
From: withgott.pa@XEROX.ARPA
Subject: Research summary for the last meeting of the Fall Quarter
To: Bush@SRI-KL.ARPA, DeKleer.pa@XEROX.ARPA, Doron@SRI-AI.ARPA,
Grosz@SRI-AI.ARPA, Halvorsen.pa@XEROX.ARPA, Lauri@SRI-AI.ARPA,
McCarthy@SU-CSLI.ARPA, Menzel@SU-CSLI.ARPA, Moore@SRI-AI.ARPA,
PCohen@SRI-AI.ARPA, Perrault@SRI-AI.ARPA, Perrault@SRI-AI.ARPA,
Peters@SU-CSLI.ARPA, Pentland@SU-CSLI.ARPA, Rosenschein@SRI-AI.ARPA,
Sag@SU-CSLI.ARPA, Sells@SU-CSLI.ARPA, Smith.pa@XEROX.ARPA,
Uszkoreit@SRI-AI.ARPA, Witkin@SU-CSLI.ARPA, Zalta@SU-CSLI.ARPA
cc: withgott.pa@XEROX.ARPA, meseguer@SRI-AI.ARPA, barwise@SU-CSLI.ARPA
I'm preparing a hand-out for next week's seminar which will consist of
summaries of your research seminars. Its purpose is to gather in one
place a record of ongoing research reported to the members of CSLI this
fall. It's in order to help inform those who could not attend some of
the talks, to create an opportunity to allow you to update what you
said, and maybe to facilitate new collaboration.
Each speaker/discussant will receive a summary to briefly work over. For
consistency in style, everything has been put in the 3d person,
otherwise, little has been changed. Some will want to leave well enough
alone, or perhaps add a reference or two. Others may feel inspired.
I'll collate it all Wednesday evening. If you'd like some models, ask
me and I'll send you the whole document as it stands on Monday.
For Pepe and me, thanks for participating in the seminar series, and
making the organization as easy as it was.
-- Meg W.
∂07-Dec-84 1740 @SU-CSLI.ARPA:withgott.pa@Xerox.ARPA summary
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 7 Dec 84 17:39:43 PST
Received: from Xerox.ARPA by SU-CSLI.ARPA with TCP; Fri 7 Dec 84 17:39:04-PST
Received: from Tokay.ms by ArpaGateway.ms ; 07 DEC 84 17:28:44 PST
Date: 7 Dec 84 17:02 PST
From: withgott.pa@XEROX.ARPA
Subject: summary
To: McCarthy@SU-CSLI.ARPA, Moore@SRI-AI.ARPA
cc: withgott.pa@XEROX.ARPA, meseguer@SRI-AI.ARPA
Natural Language from the Standpoint of Artificial Intelligence
John McCarthy
An intelligent individual, human or computer program, must act on the
basis of what it believes in advance modified by what it observes and
what it learns from linguistic communication. McCarthy argued that
thinking about how the achievement of goals is helped by communication
leads to a somewhat different point of view from one derived mainly from
study of the corpus of spoken and written language. Namely,
1. Communication should be regarded as a modifier of state of mind.
2. The most basic form of communication is the single word sentence
uttered under conditions in whjich the speaker and hearer share enough
knowledge so that the single word suffices. The complete sentence
develops under conditions in which the speaker and the hearers share
less context.
3. Many of the characteristics of language are determined by so far
unrecognized requirements of the communication situation. They will
apply to machines as well as people.
4. An effort to make a common Business Communication Language for
commercial communication among machines belonging to different
organizations exhibits interesting problems of the semantics of
language.
Bob Moore served as the discussant *** AND...
∂07-Dec-84 1752 SMC
Recursive Programs As Functions in a First Order Theory
John, Could you bring an original copy of this home with you tonight?
The boldface in the equations will be much easier if I have that to compare
to. Thanx.
∂08-Dec-84 1221 TIBSHIRANI@SU-SCORE.ARPA Car
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Dec 84 12:20:55 PST
Date: Sat 8 Dec 84 12:19:45-PST
From: Robert Tibshirani <TIBSHIRANI@SU-SCORE.ARPA>
Subject: Car
To: mccarthy@SU-SCORE.ARPA
Your daughter was over looking at our Datsun 210 last week. Is
she still looking for a car? We are leaving in 2 weeks and want to
get rid of it, so we'll sell it for $2200. That's really a good price.
Please have her call rob at 324-2486 if she's still interested.
Rob Tibshirani
-------
∂09-Dec-84 0912 JDLH@SU-SCORE.ARPA [Leonor M. Abraido <ABRAIDO@SU-SCORE.ARPA>: Needed--Graphics Facilities]
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 9 Dec 84 09:11:53 PST
Received: from SU-SCORE.ARPA by Pescadero with TCP; Sun, 9 Dec 84 09:10:39 pst
Date: Fri 7 Dec 84 23:59:49-PST
From: Jim DeLaHunt <JDLH@SU-SCORE.ARPA>
Subject: [Leonor M. Abraido <ABRAIDO@SU-SCORE.ARPA>: Needed--Graphics Facilities]
To: csdfacilities@SU-PESCADERO.ARPA
Cc: JDLH@SU-SCORE.ARPA
[File this under "Existing demand for David's SUNs". Let's buy them
critters and get them set up for general access! --JDLH]
---------------
Mail-From: ABRAIDO created at 7-Dec-84 18:27:57
Date: Fri 7 Dec 84 18:27:57-PST
From: Leonor M. Abraido <ABRAIDO@SU-SCORE.ARPA>
Subject: Needed--Graphics Facilities
To: jjw@SU-AI.ARPA, mogul@SU-SCORE.ARPA, delahunt@SU-SCORE.ARPA
If CSD offers a graphics course, it should provide adequate facilities for
doing graphics.
In the past, the only terminals available were GIGIs and Altos, both of which
are scarce. To make matters worse, few people know anything about either
terminal, so that students were forced to rely on existing documentation and
their own wits. This meant that at times, it was necessary to devote more
time to figuring out how to make the hardware do what you wanted it to than
to the actual algorithms/concepts that were presented in class (as Jeff knows,
I spent an inordinate amount of time trying to figure out an Alto bug; I
finally had to go see a Xerox Alto/Mesa guru, and I was lucky to have found
one who was willing to help me). One last strike against them: GIGI graphics
aren't very good, and the Alto is obsolete! In summary, Steve Rubin, the
instructor of CS148, would issue a warning at the beginning of class: "It's
your responsibility to find a terminal to work on".
Hopefully, all three of you are convinced that getting graphics terminals is
an urgent matter, and it shouldn't be too hard to convince Nils (just send him
to me if he gives you any trouble!). Anyway, maybe I'm dreaming now, but we
should try to get SUNs. Steve says they're about the best for graphics, we
already have a few, and maybe we can convince Sun Microsystems to give us a
few more (after all, the founder of the company is a graduate of CSD, and they
can use it as a tax write-off).
So much for flaming--the fireball is now in your hands,
Leonor
-------
-------
∂09-Dec-84 1300 VAL Breaking the boat
I feel, too, that the problem is related to the unique names hypothesis.
Actually, it can be solved if we accept the axioms you introduced in your
Workshop paper to prove the distinctness of terms, since they imply
∀x s. break(x,s) ≠ s0.
The problem with this "solution" is that the axioms we're using are extremely
strong and have many undesirable consequences. If, for instance, we use the
"result" function then we get
∀a s. result(a,s) ≠ s0,
i.e. the current situation is not the result of any action whatsoever! This is
too much. We may wish to postulate, say the action "skip" with the prooerty
∀s. result(skip, s) = s,
which contradicts the previous formula. Maybe we'll have to somehow specify in
the theory which special cases of your "distinctness of terms" are included in
the set of axioms. The range of the function "break" is, so to speak, sparse, i.e.
few situations happen to be its values. For this reason, we consider it abnormal
if s0 happens to be one of these situations. But "result" is not sparse: all (or
most) situations are the results of actions. Perhaps the description of a
circumscriptive theory should include a list of predicates that are considered
sparse. If all predicates of the form λx.x=c are in the list then we get the
unique names hypothesis as a special case.
Vladimir
∂10-Dec-84 0900 JMC*
Jim Adams
∂10-Dec-84 0920 LIBRARY@SU-SCORE.ARPA Socrates, Ethernet Connection, & Collecting Citations and Sendig via electronic mail
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Dec 84 09:20:38 PST
Date: Mon 10 Dec 84 09:17:45-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Socrates, Ethernet Connection, & Collecting Citations and Sendig via electronic mail
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA, bronstein@SU-SCORE.ARPA,
: ;
Those of you with SOCRATES accounts are now able to telenet into SOCRATES
from SCORE, SAIL, SUMEX-AIM etc. I have had a question about how to collect
citations from SOCRATES and send them to your SCORE, SAIL, etc. accounts.
On the green sheet I handed out with the free accounts check under number
11. (The Green Sheet should have a September 10, 1984 date) Briefly this
is how you would do it:
Add the TO ACCOUNT option to any SCAN or DISPLAY command. No more than 2,000
lines of citations may be mailed in one command. For example:
DISPLAY 1/5 FULL to ACCOUNT
Socrates then asks for the account and computer to send the citations to.
If you find citations on SOCRATES without call numbers and they appear to
be "on order" or "in processing" be sure to send the citation to us
with your name if you need to see the material. We can then up the
processing priority for you and list you as wanting to be notified when
it does get to the library.
Now that SOCRATES is available to everyone who has access to a departmental
terminal (SCORE, SAIL, SUMEX-AIM) those of you who need an account can come
by the Math/CS Library to fill out a form and pick up your account number
and password.
Harry Llull
-------
∂10-Dec-84 1011 RA
Keith Clark from Imperial College, London called. Wanted to know
whether he can use your name as a referee. He'll call back later this
week. In case you are not here, what shall I tell him?
∂10-Dec-84 1029 RESTIVO@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Dec 84 10:28:55 PST
Date: Mon 10 Dec 84 10:27:37-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
[cwr] Thank you again for writing these letters of recommendation for
me. MIT and Stanford say they need to recieve them by 15.1 and
1.1 and that the letters be included in the admission packet I
submit. I leave for Cambridge on the 22nd for 2 weeks.
Please send the recommendations in the envelopes provided to me.
Thanks again for your help.
Chuck Restivo
326-5550
Box 4584
Stanford
-------
∂10-Dec-84 1029 LIBRARY@SU-SCORE.ARPA Khrushchev Search on Socrates
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Dec 84 10:29:10 PST
Date: Mon 10 Dec 84 10:27:46-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Khrushchev Search on Socrates
To: jmc@SU-AI.ARPA
Can you send me the exact search you did where you questioned the number of
hits in the results between Khrushchev and Khrushchev N S? I need to
know such things as whether you were in headings lookup mode or a selected
file in command mode. I did the search in command mode with Khrushchev as
author and Khrushchev N S and the number of hits seemed appropriatefor the
two searches.
Harry
-------
∂10-Dec-84 1100 JMC*
Lifschitz appointment
∂10-Dec-84 1139 RA
Are you going to be in today? Generally, could you let me know when
(and if) you are going to be in.
∂10-Dec-84 1159 RA
Two letters on your desk for signature
∂10-Dec-84 1225 RA
I need your cancelled check for the registration for the nonmonotonic
conference inorder to do your expense report.
∂10-Dec-84 1322 RA
Claudia Mazzetti called re the review list, please call her 328 3123
∂10-Dec-84 1414 GOLUB@SU-SCORE.ARPA lunch
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Dec 84 14:13:48 PST
Date: Mon 10 Dec 84 14:09:23-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: lunch
To: faculty@SU-SCORE.ARPA
There'll be no faculty lunch tomorrow. The next such lunch will take place
on Tuesday, Jan 8. GENE
-------
∂10-Dec-84 1432 GOLUB@SU-SCORE.ARPA Faculty meeting
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Dec 84 14:32:05 PST
Date: Mon 10 Dec 84 14:15:04-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Faculty meeting
To: faculty@SU-SCORE.ARPA
The first faculty meeting of the winter quarter will take place on
Tuesday, Jan 8. If you have any agenda items, please send them to me.
Nils is out of town and I will help in organizing the agenda, though I
will be out of town that week.
GENE
-------
∂10-Dec-84 1455 TAJNAI@SU-SCORE.ARPA EG&G Idaho
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Dec 84 14:54:49 PST
Date: Mon 10 Dec 84 14:46:35-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: EG&G Idaho
To: jmc@SU-AI.ARPA
John, have you reached a decision regarding being the faculty
maintainer for EG&G Idaho (of Idaho Falls, Idaho)??
Carolyn
-------
∂10-Dec-84 1540 RA
Richard Gordon from Silicon Valley Research Group @ UC Santa Cruz
(408) 425 1865 would like you to call him re a conference on the
military and coputer science technology.
∂10-Dec-84 1543 RA
Please call Claudia Mazzetti @ 328 3123
∂10-Dec-84 1545 RA Final and TV students
Do you intend for TV students to take the final in class or in their
respective location?
∂10-Dec-84 2154 @SU-SCORE.ARPA:cheriton@Pescadero Vote: should we buy Dept. SUN workstations
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Dec 84 21:54:14 PST
Received: from Pescadero by SU-SCORE.ARPA with TCP; Mon 10 Dec 84 21:51:02-PST
Date: Mon, 10 Dec 84 21:51:03 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Vote: should we buy Dept. SUN workstations
To: faculty@score
The computer facilities committee has agreed with a proposal of mine
to purchase 10 SUN workstations using $75,000 of dept. (Stauffer fund) money.
Gene has asked me to poll the faculty to get a sense whether the faculty
as a whole supports this expenditure. So please let me know if you are in
support, are neutral or object (heavens, dont do that!).
Basic Proposal
The objective is to provide our students with a better computing
environment around the department. The SUN workstations would provide graphic
displays, local computational power and memory (2 meg.) and direct access to
the Ethernet. They would allow students to do programming projects and course
assignments as well as general computing that is poorly suited for our
current timesharing systems. (Of course, this is only a small part of
providing adequate computational facilities for education in the dept.
Hopefully, we will have lots of other solutions coming forward as well,
including Lisp workstations.)
The plan is to acquire the SUN Model 50 "single-board" diskless workstation,
which with 30 percent discount, costs $9830 each. We are counting on getting
some money from the dean (1/3) so the capital cost to the dept. will be
about $67K for 10. These machines will run V (our distributed system) or
Unix. The 30 percent discount is good only until Dec. 31st, 1984, hence the
concern to proceed with this soon.
Yeah! or neigh?
∂10-Dec-84 2246 REGES@SU-SCORE.ARPA Dave's SUNs
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Dec 84 22:46:13 PST
Date: Mon 10 Dec 84 22:42:47-PST
From: Stuart Reges <REGES@SU-SCORE.ARPA>
Subject: Dave's SUNs
To: faculty@SU-SCORE.ARPA
Office: Margaret Jacks 210, 497-9798
I personally think it would be great to have 10 SUNs for our students, but we
have to think carefully about how they fit into courses. Jeff Ullman's
computer usage policy (passed by the faculty last year) says that Department
facilities cannot be used for coursework unless all students have access to the
equipment (i.e., we can't give our students preferential treatment). When the
graphics course is taught, for example, we either have to give all 100 students
in the class access to the SUNs or we have to tell our students that they can't
use the machines for the course. If we let those 100 students use the
machines, then we suddenly have lines of people waiting for the SUNs and we
have many extra people in our building. And if we don't let our students use
the equipment, we are in the ludicrous position of saying, "You can use this
equipment for fun, but you have to go over to LOTS and use a gigi terminal for
your graphics project."
I'm not saying this is a reason to reject Dave's proposal. Quite to the
contrary, I strongly support the idea. I just think we need to think about
issues like these before we obtain the equipment.
-------
∂11-Dec-84 0936 @SU-SCORE.ARPA:lantz@Pescadero Ridge Computers open house
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 11 Dec 84 09:36:22 PST
Received: from Pescadero by SU-SCORE.ARPA with TCP; Tue 11 Dec 84 09:33:46-PST
From: Keith Lantz <lantz@Pescadero>
Date: 11 Dec 1984 0933-PST (Tuesday)
To: faculty@score, csl-faculty@sierra
Cc:
Subject: Ridge Computers open house
If you're interested in high-performance, RISC-ish, graphics workstations with
better-than-VAX-780 performance and less-than-$50K pricetags, you might
be interested in attending an open house at Ridge Computers, this
Thursday from 4-8pm at 2451 Mission College Blvd., Santa Clara (101
South to Bower Ave. / Great America Pkwy, turn left on Great American
Pkwy to Mission College Blvd, turn right to the second light, turn left
and you're there). If you plan on going, please drop me a message.
∂11-Dec-84 0943 LIBRARY@SU-SCORE.ARPA New Books -- Math/CS Library
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 11 Dec 84 09:43:44 PST
Date: Tue 11 Dec 84 09:37:21-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: New Books -- Math/CS Library
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
Mathematical Solitaires and Games. Excursions in Recreational Mathematics.
edited by Benjamin Schwartz QA95.M368
TSA An Interactive Package for Time Series Analysis Release 1 by Henstridge
NAG QA280.T72 1982
Artificial Intelligence Human Effects ed. Yazdani and Narayanan Q335.A7874 1984
The American Pascal Standard With Annotations prepared by Ledgard QA76.73.P2
L393 1984
Advances In Computer System Security (collection of previously published
articles) ed. by Rein Turn QA76.9.A25A37
Tutorial Programming Productivity: Issues for the Eighties IEEE Computer
Society. by C. Jones QA76.6T8834
Seventh IBM Symposium on Mathematical Foundations of Computer Science.
Mathematical Theory of Computations. Proceedings. (8413241)
Working with RT-11 by Beaumont, Summerfield, Wright. QA76.6B424 1983
Tailoring RT-11 by Clinch, Peters, Small, Summerfield QA76.6.T34 1984
Programming With RT-11. Volume 1 by Clinch and Peters QA76.6C55 1984 v.1
Volume 2 by Peters, Small, Summerfield, Wright QA76.6C55 1984 v.2
HL
-------
∂11-Dec-84 0953 L.LANSDALE@LOTS-A AI and Supercomputing
Received: from LOTS-A by SU-AI with PUP; 11-Dec-84 09:53 PST
Date: Tue 11 Dec 84 09:02:21-PST
From: Susan Lansdale <L.LANSDALE@LOTS-A>
Subject: AI and Supercomputing
To: jmc@SAIL, rindfleisch@SUMEX-AIM, nilsson@SRI-AI.ARPA, zm@SAIL, golub@Navajo,
wiederhold@SUMEX-AIM
cc: s.street@LOTS-A
I am sure that by now you each have received information
regarding Stanford's participation in the San Diego Supercomputer
Center (SDSC) proposal to NSF. We continue to await NSF's
decision on funding for the final national supercomputing sites.
Meanwhile, GA Technologies, the company working to coordinate the
SDSC proposal, has approached Stanford with the idea of our
joining with them to host a Workshop on Supercomputer
Applications in Artificial Intelligence. They want to go to NSF
with a request for funding for the workshop, as well as inviting
the University of Washington to co-host. Does the topic or the
idea of a workshop interest anyone out there?
Susan Lansdale 7-9222
-------
∂11-Dec-84 1002 @SU-SCORE.ARPA:ullman@diablo Re: Vote: should we buy Dept. SUN workstations
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 11 Dec 84 10:02:20 PST
Received: from diablo.ARPA (SU-AIMVAX.ARPA.#Internet) by SU-SCORE.ARPA with TCP; Tue 11 Dec 84 09:57:33-PST
Date: Tue, 11 Dec 84 10:00:09 pst
From: Jeff Ullman <ullman@diablo>
Subject: Re: Vote: should we buy Dept. SUN workstations
To: cheriton@Pescadero, faculty@SU-Score
I would be very happy to see those SUNs.
∂11-Dec-84 1012 @SU-SCORE.ARPA:ullman@diablo Re: Dave's SUNs
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 11 Dec 84 10:12:09 PST
Received: from diablo.ARPA (SU-AIMVAX.ARPA.#Internet) by SU-SCORE.ARPA with TCP; Tue 11 Dec 84 09:59:07-PST
Date: Tue, 11 Dec 84 10:01:49 pst
From: Jeff Ullman <ullman@diablo>
Subject: Re: Dave's SUNs
To: REGES@SU-Score, faculty@SU-Score
If we need equipment like SUNs for coursework, we should
lean on the Dean of Engineering, who has reportedly been
promised whatever resources are needed for instruction in
"Computer Engineering."
∂11-Dec-84 1021 AAAI-OFFICE@SUMEX-AIM.ARPA AAAI's use of the new file computer
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 11 Dec 84 10:20:59 PST
Date: Tue 11 Dec 84 10:21:00-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: AAAI's use of the new file computer
To: Bosack@SU-SCORE.ARPA
cc: aaai-office@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
I was given your name by John MCCarthy to contact to inquire about
the use fee associated with the new file computer. The AAAI is
interested ultimately in providing a full text bibliographic service
to the AI Community. The AAAI initially would like to start to
collect a bibliography and available text (ie tech notes, AI MAgazine
articles). We foresee that initially we'll need 10 megabytes (for the
bibliography); then an additional 500 megabytes/year; and then
ultimately with a full text 5 gigabytes.
According to John and Mike, the faculty has informally agreed to
the AAAI's use of this machine. So, I'd like to begin to arrive
at some figure about our use on this computer. I know we would
prefer to pay as we go; I assume there is a hefty SU overhead
associated the use or is there a straight per hour, etc rate
(a built-in overhead rate)?
We're in the process of developing a budget for next year so
I hope we can come to some agreement on the rate soon.
Thank you for your time to this matter.
Regards,
Claudia Mazzetti
-------
∂11-Dec-84 1038 JJW Synapse
To: JMC@SU-AI.ARPA, CLT@SU-AI.ARPA, RPG@SU-AI.ARPA, LES@SU-AI.ARPA
I read some of Cheriton's papers on the V kernel last night, and it looks
to me like V would be better for our use of the Synapse than Synapse's KOS
operating system. Some of the reasons are:
> V has the concept of processes sharing an address space built in (they
call it "teams"). KOS might have something like this; it wasn't clear
to me from the meeting last week.
> V was designed to optimize message passing time. It isn't clear that
KOS optimizes anything. (I don't know the statistics of either system
on process creation time, a number which we would find useful.)
> V is much simpler. The fact that it is 14,000 lines of code and KOS is
over 200,000 should be indicative.
> KOS has this ugly restriction to only 3 or 4 MB of the 16 MB address
space, because of their segmentation, unless you throw away a lot of
the system and run Lisp in "single-user" mode.
> KOS would have to be modified "internally", i.e., changing some of its
fundamental ideas, though not in an extremely major way. V would need
more "external" changes to deal with the hardware, but the only internal
modification we've indentified so far is the need to interrupt processes.
> V is written and maintained by people we know, and they are willing to
bring it up on the Synapse. The Synapse software people have all these
political obstacles to deal with. It's also not clear how responsive
they'd be to requests for changes, after the initial modifications are
done.
Did the Synapse people ever tell us whether their preference would be to
sell us their operating system, given that we could instead use our own?
If they have no objection to selling us hardware without an operating
system, then I think this is what we should propose. We should still push
as much as possible for Ethernet or some other sort of network, since this
will make the system much more accessible. We might even consider
attaching an Ethernet interface ourselves if they're willing to tell us
how the I/O system works. That project should be well within the range of
what Len's people can do in a reasonable amount of time.
∂11-Dec-84 1048 @SU-SCORE.ARPA:TW@SU-AI.ARPA Proposal for suns
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 11 Dec 84 10:48:14 PST
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Tue 11 Dec 84 10:45:32-PST
Date: 11 Dec 84 1046 PST
From: Terry Winograd <TW@SU-AI.ARPA>
Subject: Proposal for suns
To: cheriton@SU-NAVAJO.ARPA
CC: faculty@SU-SCORE.ARPA
Where are the SUNs going to go? At the moment, we have more machines
and terminals than fit in Jacks already, including the hallways. Are
these to displace some, go in another building, or just need to elbow
things aside? -t
∂11-Dec-84 1147 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA meeting time
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 11 Dec 84 11:47:12 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Tue 11 Dec 84 11:45:21-PST
Date: Tue 11 Dec 84 10:33:40-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: meeting time
To: f4@SU-CSLI.ARPA
It appears that there is no afternoon time slot next quarter that does
not have some serious conflict. Perry and Barwise's philosophy of
language seminar begins halfway through the quarter and is scheduled
for Monday and Wednesday afternoons 3:15-5:05. Joe Halpern from IBM
is scheduled to hold what promises to be a very interesting seminar on
reasoning about knowledge on Tuesdays from 2:45-5:00. David Israel's
graduate seminar is also scheduled for later Tuesday afternoons. That
leaves only Friday, which I am sure everyone would like to avoid.
I would like to hear from everyone (1) what their unchangeable time
commitments are for next quarter, and (2) how they would feel about
meeting in the morning (say, from 10-12) or on Friday afternoon.
--Bob
-------
∂11-Dec-84 1352 RA
Teller's secretary called to let you know he won't be able to make it
tonight.
∂11-Dec-84 1514 AAAI-OFFICE@SUMEX-AIM.ARPA HPP Film
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 11 Dec 84 15:14:12 PST
Date: Tue 11 Dec 84 15:11:23-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: HPP Film
To: Amarel@RUTGERS.ARPA, Brachman@SRI-KL.ARPA, Bledsoe@UTEXAS-20.ARPA,
Buchanan@SUMEX-AIM.ARPA, KRD@MIT-MC.ARPA, Engelmore@SUMEX-AIM.ARPA,
Lerman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA, Grosz@SRI-AI.ARPA,
Hart@SRI-KL.ARPA, JMC@SU-AI.ARPA, Minsky@MIT-MC.ARPA, Nilsson@SRI-AI.ARPA,
Reddy@CMU-CS-A.ARPA, Stan@SRI-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA,
Rich@MIT-MC.ARPA, Stefik@XEROX.ARPA, Tenenbaum@SRI-KL.ARPA,
bellcore!walker@UCB-VAX.ARPA, PHW@MIT-MC.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Thank you for providing your comments and suggestions about how the
and when the AAAI should support (and endorse) any media presentation.
After reviewing your comments, we'd now like to propose to support the
HPP film by donating the $5k bu will hold off any sponsorship until
Executive Council members review the finished product.
We'd like to proceed with this proposal unless you feel we need some
additional discussion on this matter.
Regards,
Claudia
-------
∂12-Dec-84 0834 GOLUB@SU-SCORE.ARPA New Chairman
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Dec 84 08:34:02 PST
Date: Wed 12 Dec 84 08:31:15-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: New Chairman
To: su-bboards@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA
I'm pleased to say that the Board Of Trustees has approved the appointment
of Nils Nilsson and he will take over as chairman at the beginning of the
New Year. Welcome on board, Nils.
Gene Golub
-------
∂12-Dec-84 0915 @SU-SCORE.ARPA:DEK@SU-AI.ARPA to Cheriton re SUNs
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Dec 84 09:15:12 PST
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Wed 12 Dec 84 09:12:40-PST
Date: 12 Dec 84 0912 PST
From: Don Knuth <DEK@SU-AI.ARPA>
Subject: to Cheriton re SUNs
To: faculty@SU-SCORE.ARPA
Dave, as you know, I've been strongly in favor of this for a long time.
Will my students in CS204 be able to use them next quarter?
∂12-Dec-84 0925 LIBRARY@SU-SCORE.ARPA Math/CS Library Services by Electronic Mail
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Dec 84 09:25:39 PST
Date: Wed 12 Dec 84 09:21:46-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Math/CS Library Services by Electronic Mail
To: su-bboard@SU-SCORE.ARPA
cc: faculty@SU-SCORE.ARPA,
: ;
As more people use our services via electronic mail, I would like to outline
a few more guidelines so that we can process the requests more efficiently.
The following subject headers should be used.
Book Request (this can apply to either a book I need to order or a book in
the collection that you suspect is checked out and want to
have recalled for you)
New Books Request (this would apply only to requests in response to new book
announcements. These requests should be made within a week
of the announcement. A week is the time period a book
is on display in the library. Your name will be placed on
a waiting list and you will be notified when it is available)
New Technical Reports Request (this would apply to requests in response to the
posting of the new technical reports lists)
Technical Reports Request (This should be used when you can not find a technical
report in our collection and you think we need to
order it)
Reference Question
Library Policy or Procedure Question
When responding to a query for opinions or suggestion use the header under which
the request went out.
I would like to encourage you to transfer electronically any bibliographic
records you have questions about from SOCRATES to us with your question or
appropriate request. Be sure to repeat both your full electronic address
and physical address at the end of your message. We are experiencing some
problems with people not writing their electronic address clearly enough
on check-out cards and hold requests. Messages bouncing back require a
lot of our time looking up the correct address. So please take time to
write your addresses clearly and remember we have part-time student
assistants sending out many of the messages.
If you have any questions or suggestions on how we can better use this
media, let me know. Also, if anyone can teach/help us with setting
up an automatic filer for our mail, electronic forms for recalls, etc
I can use some help.
Harry Llull
-------
∂12-Dec-84 1026 RA
I put on your desk the envelop to MIT to be signed on the back by you.
∂12-Dec-84 1034 RA transparencies
The transparencies you wanted made are now in a file called SLIDES & TRANSPARENCIES
in the current business drawer.
∂12-Dec-84 1125 RA
John Backus called re the course you suggested. He will try to call you
tomorrow. If you want to call him, his # 545 3052.
∂12-Dec-84 1248 RA sick
I didn't feel well and went home.
∂12-Dec-84 1306 AI.WOODY@MCC.ARPA Your visti to MCC
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 12 Dec 84 13:05:57 PST
Date: Wed 12 Dec 84 15:06:22-CST
From: Woody Bledsoe <AI.Woody@MCC.ARPA>
Subject: Your visti to MCC
To: JMC@SU-AI.ARPA
cc: AI.Woody@MCC.ARPA
John,
We are looking forward to your visit next Friday, Dec 21.
Should we make some Hotel reservations for you? We have a nice
place near MCC, the Woodhollow (or the Holiday Inn is also near.)
Let me know if we can help.
Woody
-------
∂12-Dec-84 1548 RTC
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Dec 84 13:42:09 PST
Received: from ucla-locus.arpa by SU-SCORE.ARPA with TCP; Wed 12 Dec 84 13:40:57-PST
Date: Wed, 12 Dec 84 13:28:43 PST
From: Ingemar Ahlberg <ingemar@UCLA-LOCUS.ARPA>
To: casley@score
Message-ID: <471734923-14371-ingemar@UCLA-LOCUS.ARPA>
Last summer I saw on the su/bboard a note about a project :
"Editor based operating system written in CommonLisp"
suggested by Mc Carthy.
I asked Goran Fagerstrom (Fagerstrom@SU-SCORE.ARPA) about it today
and he suggested me to ask you. According to him the project has not
gone very far. Do you have any (preliminary) paper about the thoughts
behind the project. I am quite interested in whatr such a thing
could be. Could you send me any information about it ?
Best regards
Ingemar Ahlberg (ingemar@ucla-cs.arpa)
∂12-Dec-84 1626 SJG dinner some time?
I'd like to pick up our aborted probability conversation; can you suggest
a suitable time? I'd also like to talk to you about counterfactuals, if
you're interested. I'd ESPECIALLY like to know if you ARE interested; Mike
and his group generally feel that the problem is an interesting one, but
nobody can think of any clear AI examples where it's important.
Matt
∂12-Dec-84 1650 GOLUB@SU-SCORE.ARPA Reviewing proposals
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Dec 84 16:50:42 PST
Date: Wed 12 Dec 84 16:29:57-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Reviewing proposals
To: faculty@SU-SCORE.ARPA
I recently visited NSF and they are very concerned about the slowness in
reviewing proposals. They generally try to get six reviewers per proposal
but sometimes they make decisions on three reports. The lapsed time from
receipt until award may be nine months. So if you receive a proposal, try to
get a report in within a month. A careful and detailed review would be
especially appreciated. Thanks for your help on this.
GENE
-------
∂12-Dec-84 1718 CHEESEMAN@SRI-AI.ARPA Probability and AI Workshop
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 12 Dec 84 17:17:46 PST
Date: Wed 12 Dec 84 17:19:55-PST
From: P. Cheeseman <cheeseman@SRI-AI.ARPA>
Subject: Probability and AI Workshop
To: ATP.Bledsoe@UTEXAS-20.ARPA
cc: JMC@SU-AI.ARPA, cheeseman@SRI-AI.ARPA, aaai-office@SUMEX-AIM.ARPA
Hi Woody,
The following file is a copy of the correspondence on the subject
of the "Probability and Uncertainty in AI" workshop (UCLA, Aug. 1985).
-----------------------------------------------------------------
To: John McCarthy.
From: Peter Cheeseman (SRI International) and
John Lemmer (PAR Corp.)
cc: Claudia Mazzetti
Subject: Proposed Workshop
This letter is to request AAAI support for a workshop on:
"Probability and Uncertainty in AI"
To be held on 14-16th August, 1985 (just prior to IJCAI).
at University of California, Los Angeles
The purpose of this workshop is to bring together those who have an
interest in using probability theory (or its near equivalents) for
solving the problems associated with representing and reasoning
about uncertainty in AI. In particular, we are encouraging papers on
the following subjects:-
*The relationship between logic, non-monotonic logic and
probability
*Use of probability (and Baye's Theorem) for inductive inference
*Use of probability for prediction and estimation (especially in
expert systems).
*Higher order probabilites (probabilities of probabilities)
*Interpretations of probability (e.g. as a measure of belief,
frequency etc.)
*Procedures for efficient compuation of probabilities in particular
cases.
*Commonly used probabilistic assumptions (e.g., independence and
conditional independence)
etc. (we are open to suggestions)
It is intended that the workshop will have limited attendance
(approx. 50 people), that quality papers be sought and accepted
by review and a procedings be published. Any profits from procedings
sales will go to AAAI (negotiations with Kaufmann are continuing).
We look forward to your cooperation...
Peter Cheeseman and John Lemmer.
Peter Cheeseman and John Lemmer
---------------
30-Nov-84 17:32:27-PST,2234;000000000001
Mail-From: CHEESEMAN created at 30-Nov-84 17:32:25
Date: Fri 30 Nov 84 17:32:25-PST
From: P. Cheeseman <cheeseman@SRI-AI.ARPA>
Subject: Proposed Workshop
To: jmc@SU-AI.ARPA
cc: cheeseman@SRI-AI.ARPA, aaai-office@SUMEX-AIM.ARPA
Hi John,
The following is the information you requested on the proposed
"Probability and Uncertainty in AI" workshop.
The General Chairman is Peter Cheeseman (SRI International)
The Program Chairman is John Lemmer (PAR Corp.)
The Program committee is:
Leveen Kanal (Univ. of Maryland)
Judea Pearl (UCLA)
Eugene Ruspini (Currently at SRI)
Lotfi Zadeh (Berekley)
The important dates (currently) are:
Dec. 1984, Call for papers.
March 30th. Abstract/paper submittion deadline
April 20th. Notification of acceptances/rejections
May 24th. Submittion of camera ready copy
June 7th. All papers to publisher (Kaufmann)
August 14,15,16th. Workshop at UCLA (exact location to be determined)
Aug. 18th-23rd. IJCAI (UCLA)
The focus of this workshop is to explore the limitations,
advantages and alternatives to the use of probability as a general
method for representing and reasoning about uncertainty in AI. The
emphasis is on application and interpretation of probability and
uncertainty in concrete examples to avoid the difficulties of
discussion at too abstract a level (where there is confusion about
meaning of terms). Alternative methods for representing uncertain
will only be considered by their relationship (if any) to probability,
or their proported ability to solve problems that a probabilistic
approach cannot.
The proposed workshop framework is paper presentation with ample
time for presentation and discussion, plus some panel discussions on
specific topics yet to be determined. The workshop will be keep
small, the actual size will depend on the response, but probably about
50 people. Most participants will be by invitation, remaining places
being filled on a first come first served basis.
Thank you for your previous prompt reply, sorry I have not been able
to respond till now...
Peter Cheeseman
---------------
P.S. Are you interested in participating in this workshop yourself?
-------
30-Nov-84 20:01:55-PST,580;000000000001
Return-Path: <JMC@SU-AI.ARPA>
Received: from SU-AI.ARPA by SRI-AI.ARPA with TCP; Fri 30 Nov 84 20:01:53-PST
Date: 30 Nov 84 2001 PST
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: Workshop on probability and uncertainty in AI
To: cheeseman@SRI-AI.ARPA, aaai-office@SUMEX-AIM.ARPA,
bledsoe@UTEXAS-20.ARPA
This is sufficient information, and I agree that AAAI should support
the workshop. I probably won't participate but might if I can
formulate a position on where probabilistic reasoning fits into
a more general picture of non-monotonic reasoning.
---------------------------------------------------------
3-Dec-84 10:51:05-PST,1071;000000000001
Return-Path: <ATP.BLEDSOE@UTEXAS-20.ARPA>
Received: from UTEXAS-20.ARPA by SRI-AI.ARPA with TCP; Mon 3 Dec 84 10:50:59-PST
Date: Mon 3 Dec 84 12:52:08-CST
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: [John McCarthy <JMC@SU-AI.ARPA>: Workshop on probability and uncertainty in AI ]
To: cheeseman@SRI-AI.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
Could you please forward to me a copy of your workshop proposal?
Thanks, Woody
-------
∂12-Dec-84 2332 VAL unique names
There seems to be a serious problem with your solution that limits its
applicability. If bird(x) means that x is the name of a bird then we have
no way of saying anything about all birds; we can only express general
properties of those birds that have names among our constants n1, n2,... .
But we certainly can't have names for all the birds on Earth in our
language!
Vladimir
∂13-Dec-84 1103 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 meeting time
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 13 Dec 84 11:03:08 PST
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Thu 13 Dec 84 11:00:36-PST
Date: Thu 13 Dec 84 11:04:53-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: F4 meeting time
To: f4@SU-CSLI.ARPA
It appears that the only available meeting time without a serious
conflict with courses or other CSLI meetings relevant to the interests
of F4ers is early Monday afternoons. So, unless someone has an
execeptionally good reason to do otherwise, F4 will meet on alternate
Mondays from 1:15 to 3:15 beginning on January 7.
--Bob
-------
∂13-Dec-84 1300 AI.WOODY@MCC.ARPA re: Your visti to MCC
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 13 Dec 84 12:59:54 PST
Date: Thu 13 Dec 84 15:00:18-CST
From: Woody Bledsoe <AI.Woody@MCC.ARPA>
Subject: re: Your visti to MCC
To: JMC@SU-AI.ARPA
cc: AI.Woody@MCC.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 12 Dec 84 13:51:00-CST
John,
You have reservations at the Brookhollow N. W., 8888 Tallwood, 343-0008,
for December 20 and 21. The taxi can take you there or you may want to
rent a car. If you send your arrival time someone can pick you up at the
airport.
I can pick you up on Friday Morning on my way to work, if you like, it
is on my way. You have an appointment with Bob Inman at 9:00.
MCC is only about 5 blocks from the hotel.
We have scheduled a time, 10:00 AM, when you can give a talk on you ideas
about Parallel Processing, or whatever, if you want to. Dont feel obligated
to give a talk. Informal discussions will be fine also. Of course we will
give you a rundown on what we are trying to do. I want your opinion on
what we should be doing at MCC-AI. Mostly the day is unstructured.
Of course, you expenses and honorarium will be paid by MCC. I hope that
Carolyn can come too. Should be alert UT-AI folks? I thought we would
tell Bob and J about your talk if you decide to give one.
Best regards, Woody
-------
∂13-Dec-84 1438 RTC CS206 files moved
∂11-Dec-84 1535 JMC
Please move all CS206 files to 206,jmc.
-----
I have done this. I renamed some of the existing files in [206,jmc]
to NAME.82, or NAME.83 to avoid name clashes with new files.
∂13-Dec-84 1438 RA
Chuck Thayr from Harris Corp. in Melburn, Florida is interested in AI,
Expert Systems, MYCON and EMYCON. Interested in purchasing documentation
and source code. His # (305) 727 4663.
∂13-Dec-84 1611 RA Austin flight
Do you prefer an early morning on Thursday around 7:00am (get there at 1:30pm)
or 1:45pm (get there at 7:30pm? On the way back there is a United flight @6:15
which gets back to SJ @9:44pm. All flights are from SJ.
∂13-Dec-84 1619 RA make-up exam for Ben Fisk
Ben Fisk will come to my office Tuesday at 2:00 to take his final. I need a
copy of the exam.
∂13-Dec-84 2302 @SU-SCORE.ARPA:LAURENCE@SU-CSLI.ARPA recommendations, etc.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Dec 84 23:01:58 PST
Received: from SU-CSLI.ARPA by SU-SCORE.ARPA with TCP; Thu 13 Dec 84 23:00:54-PST
Date: Thu 13 Dec 84 23:00:14-PST
From: Laurence R Brothers <LAURENCE@SU-CSLI.ARPA>
Subject: recommendations, etc.
To: mccarthy@SU-SCORE.ARPA
Oh well, it seems that I may not have done superlatively well on the
CS206 final. In fact I feel at this time (half-hour afterwards), that
I have done only mediochrely, but I felt that way after taking the GRE's
and getting uniform 99th percentile scores, so it may not be as bad
as I think.
If it helps you to write the recommendation I will include a bit more data
about myself which you can take or leave (or take with a grain of salt,
for that matter).
I am a senior in the "special program in the philosophy and logic of
formal systems" here, a program in the philosophy department. As you are
probably aware, we don't actually have a regular B.S. offered in CS,
so undergraduates must take degrees in related fields like Math Sci.,
EE, and my own program which combines CS, logic, epistemology, and
linguistics. As the part of the elective segment of my major, by the
way, I will be taking your course "epistemological problems of AI"
next quarter. My major interest in CS is in AI research, and I am only
applying to schools which do maintain a reasonable level of AI work.
I am applying mostly to masters' degree CS programs with a view
towards eventually getting a Ph. D. and doing research in AI. I am
cognizant, however, of the fact that many institutions prefer to award
doctorates to people who already have masters' degrees and/or research
and industrial experience. I am also aware that a masters' is a
smaller and less irrevocable step toward a narrow career choice which
I might conceivably someday regret (naturally I don't feel anything
like this right now, but....) Since Stanford atypically wishes
graduates of its own masters' program NOT to apply to the Ph. D.
program, I am applying to both here, with a preference for the Ph. D.,
of course. I do sincerely feel that I can make a contribution to the
field of AI, and my exposure to the field so far (CS223,CS222,CS228B)
has reinforced that belief.
Well, that's about it. I'm afraid that if you wish to communicate with
me it must be by phone to NYC (212)799-0788 as I am returning
home for Christmas vacation on Saturday. It would be most helpful if
you would write and return the recommendation to CPPC as soon as
possible because several of the institutions I am applying to have
deadline dates of around Jan. 1st.
Thank you for taking the time to write the evaluation.
-Laurence R Brothers
-------
∂13-Dec-84 2340 LLW@S1-A.ARPA DoE Wackiness
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 13 Dec 84 23:40:10 PST
Date: 13 Dec 84 2333 PST
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: DoE Wackiness
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA
John, please ignore (at least for the present) the communication from the
DoE Security folks re a new PSQ. I think that this request merely represents
spastic thrashing arising from the high current pulses applied to the System's
forebrain last week, and will fade away naturally, as soon as I cease applying
follow-up pulses and start administering the anti-convulsives. (One of the
System's most deeply rooted reflex actions is to demand a fresh PSQ--it buys
time in which feverish thought can be given as to what to do next.) I'll
keep you posted! Lowell
∂14-Dec-84 0849 brand%ucbarpa@Berkeley parrallel lisps
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 14 Dec 84 08:48:49 PST
Received: from ucbarpa.ARPA by UCB-VAX.ARPA (4.24/4.40)
id AA23303; Fri, 14 Dec 84 08:49:32 pst
Received: by ucbarpa.ARPA (4.24/4.40)
id AA22419; Fri, 14 Dec 84 08:49:47 pst
Date: Fri, 14 Dec 84 08:49:47 pst
From: brand%ucbarpa@Berkeley (Russell L. Brand)
Message-Id: <8412141649.AA22419@ucbarpa.ARPA>
To: jmc@su-ai
Subject: parrallel lisps
Richard Fateman has mentioned to me that you are interested in bringing
up a parrallel lisp for super-computers. It is soon to be the case that
Lawrence Livermore National Labs MAY have an unwanted 205 (cyber) looking
forlove care and a good home...
...would you be interested in providing it a home?
Russell L. Brand
LLL Computation Research Group
∂14-Dec-84 1134 RA Austin Texas
You have a reservation on MUCE Airline flight 872, depart SJ 12/20 @ 1:45pm
arrive Austin 7:30pm. On the way back American flight 240 depart Austin 6:04,
arrive Dallas 6:49. Unfortunately you have a stop over at Dallas, you have to
wait to 9:40 for your flight to SJ.You arrive SJ at 11:12pm.
The part Dallas-SJ is first class. It was hard to get a flight back and that's
the best we could do. Shall I try and get you a Saturday morning flight? It
might not be much better.
∂14-Dec-84 1135 RA lunch date
Jim Adams will be 15 minutes late for the lunch date.
∂14-Dec-84 1621 RA flight back from Austin
The good news: You have a reservation on American flight 139 on Sat. 12/22
departure 9:24, gets to Dallas 10:09. From Dallas you take American flight
127 @ 11:15. It arrives at SJ @ 12:50pm. The bad news: For the first part
of the flight you have a center seat, and for the second part there is no
seat confirmation. Your seat will be assigned at the airport. Let me know
if this is ok with you and Frank will issue the tickets.
∂14-Dec-84 1701 TOB your chess bet
John
By what date did you bet that a computer would
be world chess champion?
Tom
∂14-Dec-84 1753 JODY@SU-CSLI.ARPA Decus
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 14 Dec 84 17:53:03 PST
Date: Fri 14 Dec 84 17:51:17-PST
From: Joe Zingheim <JODY@SU-CSLI.ARPA>
Subject: Decus
To: JMC@SU-AI.ARPA
I wish you had been able to be at Decus: You may have been embarassed by so many nice things being said of you.
I had the great joy and privilege to work with Ralph and the others on the PDP-6, and we dazzeled the visitors and attracted
more interest and admiration than any other exhibit. Many people commented that it "looked like a computer should".
We only had the AC's for memory, with a broken bit that we could have fixed if anyone had a spare 6205; we did a paper-tape
greetings generator and gave away copies of the CTY printout, and a Johnson counter light-show that made it look like it was
doing something.
Best wishes for the holidays--
Joe Zingheim
-------
∂14-Dec-84 2000 JMC*
Sarah
∂14-Dec-84 2040 dswise%indiana.csnet@csnet-relay.arpa First LISP conference
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 14 Dec 84 20:40:27 PST
Received: from indiana by csnet-relay.csnet id a018643; 14 Dec 84 23:35 EST
Received: by iuvax.UUCP (4.12/4.7)
id AA08108; Fri, 14 Dec 84 17:38:43 est
Date: Fri, 14 Dec 84 17:38:43 est
From: "David S. Wise" <dswise%indiana.csnet@csnet-relay.arpa>
To: jmc@su-ai.ARPA
Subject: First LISP conference
ACM SIGPLAN is reprinting the 1980 LISP conference proceedings.
I am preparing a new preface for it and would like to mention the Mexcio
City meeting from the early 1960's. Can you tell me when that was held?
∂15-Dec-84 1001 RESTIVO@SU-SCORE.ARPA paper & no.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Dec 84 10:01:06 PST
Date: Sat 15 Dec 84 10:00:09-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
Subject: paper & no.
To: JMC@SU-AI.ARPA
[cwr] I recieved the MIT envelope yesterday at Box 4584, Stanford.
Thank you.
The Stanford envelope has not surfaced. Was it sent directly
to the GAO?
Stanford undergraduate transfer denied my case admission
yesterday.
-------
∂15-Dec-84 1033 CLT reminder
you wanted to be reminded to send a msg to REG
∂15-Dec-84 1715 JMC*
hardware
∂15-Dec-84 2211 SMC terminal
i am getting garbage no matter what line i try
could I have some button in that wants to be out
or some such thing which could have been mooved
during transport?
∂15-Dec-84 2308 @SU-SCORE.ARPA:WIEDERHOLD@SUMEX-AIM.ARPA Re: Vote: should we buy Dept. SUN workstations
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Dec 84 23:08:02 PST
Received: from SUMEX-AIM.ARPA by SU-SCORE.ARPA with TCP; Sat 15 Dec 84 23:05:00-PST
Date: Sat 15 Dec 84 23:07:07-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
Subject: Re: Vote: should we buy Dept. SUN workstations
To: cheriton@SU-PESCADERO.ARPA
cc: faculty@SU-SCORE.ARPA
In-Reply-To: Message from "David Cheriton <cheriton@Pescadero>" of Mon 10 Dec 84 21:54:27-PST
yeah! Gio
-------
∂16-Dec-84 1330 HULLMAN@SU-SCORE.ARPA party
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 Dec 84 13:30:26 PST
Date: Sun 16 Dec 84 13:27:31-PST
From: Holly Ullman <HULLMAN@SU-SCORE.ARPA>
Subject: party
To: faculty@SU-SCORE.ARPA
A reminder that if you haven't replied to the invitation to Gene's
party (and plan to come), please let us know in the next day or
two to allow for planning.
-------
∂16-Dec-84 1426 @SU-SCORE.ARPA:reid@Glacier FYI: a letter from EWD
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 Dec 84 14:25:57 PST
Received: from Glacier by SU-SCORE.ARPA with TCP; Sun 16 Dec 84 14:22:44-PST
From: Brian Reid <reid@Glacier>
Date: 16 Dec 1984 1425-PST (Sunday)
To: faculty@score
Cc:
Subject: FYI: a letter from EWD
To: Everyone
From: Jim Horning
Date: 10 Dec 1984 1510-PST (Monday)
Subject: Dijkstra/Texas
I'm sure many of you have been wondering how Edsger Dijkstra is
adjusting to Texas (and vice versa). The first direct evidence I have
is a letter dated Wednesday 21 Nov. 1984. I thought the following
excerpts might be of interest. Jim H.
"People ask us continuously whether we like it in Austin. Of course we
do! First of all, we have no choice, and secondly we have had no time
to be unhappy. The real question is how much effort it will require in
the future to remain happy. My guess is: not unreasonably much.
"UT is not heaven on earth, but I did not expect that. ... I like my
course and my students: half of them are open, interested and critical,
just as students ought to be. ...
"I think I had a very characteristic experience at UT --where I can
summarize the situation best by `Everything is difficult, but
everything is possible.'-- in connection with my stationery. Of course,
UT's printing office was eager to print me my own official stationery
with all the titles, roomnumber, telephone and what have you. I had
been warned by friends who went to CalTech that the bond paper most
universities use is very awkward to write upon with a fountain pen. So
I had a bunch of acceptable (Xerox) sheets with me --for safety's sake I
had even recorded the code number-- . At first, the printing office was
very unwilling to depart from their standard bond paper with watermark.
I insisted and gave them by way of example an acceptable sheet. When
they said they had found something very similar, the main secretary of
the department was alert enough to react with `Don't start printing!
Send a sheet first!' It was a good thing they did obey her: it felt
similar, but turned out to be like blotting paper as soon as you wrote
on it. Only then were they willing to take notice of the Xerox code
number. This, however, did not help: the paper would have to be ordered
from Europe in a ridiculous quantity. I am sure that the same paper --in
quarto instead of A4-- is marketed in the USA, but we have not been able
to extract from Xerox the corresponding code number. Eventually, we got
from Xerox a catalogue of all the papers they market in the USA. I
spent more than an hour, trying the likely candidates with my main
pens, feeling how it felt. Eventually I ended up inspecting with a
magnifying glass (15x), how the ink had flowed. And then I made my
choice. It seems that now the last hurdle has been taken. But this
process started on the 1st of September, and as you can see, I still
don't have my own stationery. (To get the wheels in motion I had to
pose as a maniac: I told them --truthfully-- that I mix my own ink. ...)
"I am currently working on a calculus for regular expressions, but the
topic may turn out to be too difficult for me. (My problem is that I
needed that calculus and could not find it in the literature.)..."
∂17-Dec-84 0755 G.RYLAND@SU-SCORE.ARPA Brown -> Jim Jones
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Dec 84 07:55:29 PST
Date: Mon 17 Dec 84 07:54:31-PST
From: Chris Ryland <g.Ryland@SU-SCORE.ARPA>
Subject: Brown -> Jim Jones
To: jmc@SU-AI.ARPA
Can you explain this (to me) somewhat obscure statement? Are you referring
the president's policies? Thanks.
--Chris
-------
∂17-Dec-84 0813 JAMIE@SU-CSLI.ARPA Betsy's wedding
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 17 Dec 84 08:13:14 PST
Date: Mon 17 Dec 84 08:09:30-PST
From: Jamie Marks <JAMIE@SU-CSLI.ARPA>
Subject: Betsy's wedding
To: researchers@SU-CSLI.ARPA
cc: jamie@SU-CSLI.ARPA
CSLI plans to give Betsy a wedding gift. If you'd like to join in,
you can leave contributions with me in room 20 or with Suzie at the
front desk through the end of this week.
Jamie
-------
∂17-Dec-84 0900 JMC* call Jacobson about Bell
∂17-Dec-84 1417 RPG Sequent
To: JJW@SU-AI.ARPA, CLT@SU-AI.ARPA, JMC@SU-AI.ARPA,
cheriton@SU-PESCADERO.ARPA
They are sending me some stuff this week, and I've tentatively set up a Jan 7
meeting with them (Dave Rogers, in particular) at Stanford at 2pm.
-rpg-
∂17-Dec-84 1715 CLT thursday
i gather from looking at your calendar
that we should forget meeting with fateman
on thursday, shall i cancel him?
Replying-To: CLT
Reply-Subject: re: thursday
Reply-Text:
[In reply to message rcvd 17-Dec-84 17:15-PT.]
∂17-Dec-84 2325 HST invited talk
hi john.would you be interested to give an invited talk on nonmonotonic
reasoning here in germany (next september)?
did you receive the photographs?
herbert
∂17-Dec-84 2329 @SU-SCORE.ARPA:cheriton@Pescadero Re: FYI: a letter from EWD
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Dec 84 23:29:47 PST
Received: from Pescadero by SU-SCORE.ARPA with TCP; Mon 17 Dec 84 23:27:12-PST
Date: Mon, 17 Dec 84 23:27:08 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Re: FYI: a letter from EWD
To: faculty@SU-Score, reid@Glacier
Willy Zwaenepoel, a former Ph.D. student of mine and now faculty at Rice,
told me last week that they had had several very unhappy faculty from UT-Austin
interview for jobs at Rice. I guess not everyone is coping.
∂17-Dec-84 2335 HST gwai85
the meeting is the annual meeting of the ai community in germany.we call
it "german workshop in ai" because the community is not so big(we expect
150 attendees)and - to be open - the germans are not so influential in ai.
the meeting lasts for 5 days (23.-28.sept) and i'm this years program
chairman.gwai85 is held in a small town between hanover and goettingen
in some lovely hills.however,big towns are some 100km away.we expect say
20 papers some of which will have medium level.if we are lucky, we get a
good one.the papers are puiblished by springer.
i would like to spend some money to get an intersting talk.all the zyears
the invited speakers were germans and the level got worse and worse. so,
if you need an interested autditorium (i think w.bibel will be there) than
gwai could be an idea...
∂18-Dec-84 0034 LLW@S1-A.ARPA DoE Follies
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 18 Dec 84 00:15:26 PST
Date: 18 Dec 84 0013 PST
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: DoE Follies
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA
John, have you heard anything more from the Lab or DoE Security folks?
Please keep me posted, if anything happens. Lowell
∂18-Dec-84 0322 LLW@S1-A.ARPA More Follies
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 18 Dec 84 03:22:14 PST
Date: 18 Dec 84 0320 PST
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: More Follies
To: GAP@S1-A.ARPA
CC: LLW@S1-A.ARPA, jmc@SU-AI.ARPA
∂18-Dec-84 0039 JMC@SU-AI.ARPA re: DoE Follies
Received: from SU-AI.ARPA by S1-A.ARPA with TCP; 18 Dec 84 00:39:22 PST
Date: 18 Dec 84 0037 PST
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: re: DoE Follies
To: LLW@S1-A.ARPA
[In reply to message sent 18 Dec 84 0013 PST.]
Nothing but the letter from Melendez (or Menendez) of the consultant office
with the form to start the Q clearance process over. It is as though I
had just become a consultant.
[Gloria: Please contact Melendez, and tell him (her?) that I told
McCarthy to ignore this latest request until I had explained to me in
writing the legitimate requirement for it. Inform him further that David
Leary has told me that McCarthy's background investigation has been
completed, and that I can expect to hear very soon from the DoE/SAN folks on
my request for a `Q' clearance. Ask him (her) on what authority he made
the request for another PSQ from McCarthy. Thanks, Lowell]
∂18-Dec-84 0836 GROSOF@SU-SCORE.ARPA READ NOW! sudden opportunity- wrt your MCC trip
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 18 Dec 84 08:34:32 PST
Date: Tue 18 Dec 84 08:33:27-PST
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
Subject: READ NOW! sudden opportunity- wrt your MCC trip
To: jmc@SU-AI.ARPA
Hi John,
I have just traded the latest of a series of messages back and forth
with Charles Petrie at MCC. (He works with Elaine Rich and was at the
Nonmon Workshop.) He and I are both working on Truth Maintenance
systems in an attempt to mechanize default reasoning, as well as on
circumscription. We both seem to be at a point where we could very
much benefit from meeting at length. He informed me that you are
going to visit MCC this Friday, and asked me "why don't you come
along?". I'd like to go if someone would pay for the travel; if not
you, perhaps Mike Genesereth would. What do you think??? I'll be in my
office much of the time until about 4pm: 497-4368. And I'll check my e-mail
every hour or two.
Benjamin
-------
∂18-Dec-84 0900 CLT*
reschedule your thursday dentist appointment
∂18-Dec-84 0900 JMC*
Change dentist appointment.
∂18-Dec-84 0950 BOSACK@SU-SCORE.ARPA Bitnet to SLAC
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 18 Dec 84 09:50:28 PST
Date: Tue 18 Dec 84 09:49:18-PST
From: Len Bosack <BOSACK@SU-SCORE.ARPA>
Subject: Bitnet to SLAC
To: JMC@SU-AI.ARPA
Try
user%SLACVM.BITNET@FORSYTHE
I think the caps vs lower case is unimportant.
Len
-------
"elliott%slacvm.bitnet"@forsythe
testing 1 2 3 4
Elliott,
Here's how I'm told I can send you mail. The return path to
JMC@SU-AI presumably goes by bitnet to FORSYSTHE and on to SU-AI,
but I don't know the grammar.
John
∂18-Dec-84 1018 RA CS206 grades
Urgent! I need your CS206 grades, where are they?
∂18-Dec-84 1029 CLT fateman
do you have a means of getting a parking sticker for him,
or should i direct him to one of the 75cent lots?
∂18-Dec-84 1101 SMC TERMINALS
I am starting to get the hang of this terminal, I will get a copy
of essential E today and see what else I can do with it. I will
also find out about fixing the other terminal, I may bring it back to
your house and see if it still works there.
∂18-Dec-84 1359 RA final fr Ben Fisk
Ben Fisk is here to take his final, where can I find a final for him
∂18-Dec-84 1409 GROSOF@SU-SCORE.ARPA trip to MCC
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 18 Dec 84 14:08:49 PST
Date: Tue 18 Dec 84 14:07:39-PST
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
Subject: trip to MCC
To: jmc@SU-AI.ARPA
cc: gensereth@SUMEX-AIM.ARPA
Hi John,
I spoke to Charles Petrie and he is arranging to pay for my trip.
However, this week seems a bit rushed and premature, so we are
planning on my going in early January instead. I'd like to talk
to you nevertheless about the connections between TMS's and general
default reasoning in the abstract.
Benjamin
-------
∂18-Dec-84 1458 SG Nonmonotonic Symposium / Is the proceeding available?
To: JMC
CC: SG
One of my friends at ICOT wants to have a copy of the Proceedings of
Nonmonotonic Logic Symposium (Maryland).
If we can purchase it from some publisher or institute, would you please
tell me the name and address?
∂18-Dec-84 1608 RA
John Williams from IBM called. Will try again in half an hour.
∂18-Dec-84 1714 GOLUB@SU-SCORE.ARPA annoncements
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 18 Dec 84 17:13:56 PST
Date: Tue 18 Dec 84 17:11:13-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: annoncements
To: faculty@SU-SCORE.ARPA
Reply-To: olender@score
We are sending out printed announcements of Nils' appointment. Let
Margaret Olender know of any persons who should be informed. We are sending
notices to CS department heads, government agency heads, and Forum members.
GENE
-------
∂18-Dec-84 1718 GOLUB@SU-SCORE.ARPA Margaret Olender
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 18 Dec 84 17:18:26 PST
Mail-From: BSCOTT created at 18-Dec-84 15:04:48
Date: Tue 18 Dec 84 15:04:48-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Margaret Olender
To: SU-BBoards@SU-SCORE.ARPA
ReSent-Date: Tue 18 Dec 84 17:14:23-PST
ReSent-From: Gene Golub <GOLUB@SU-SCORE.ARPA>
ReSent-To: faculty@SU-SCORE.ARPA
Please welcome Margaret Olender to CSD. Margaret has joined us as Nils
Nilsson's secretary. She has been Nils' secretary at SRI and we are very
pleased to have her here in CS.
Betty
-------
∂18-Dec-84 1736 Mailer failed mail returned
To: JMC
In processing the following command:
MAIL
The following message was aborted because of a command error,
namely, nonexistent recipient(s):
olender
------- Begin undelivered message: -------
∂18-Dec-84 1736 JMC re: announcements
[In reply to message sent Tue 18 Dec 84 17:11:13-PST.]
∂18-Dec-84 1839 SG Thank you / Proceeding
To: JMC
CC: SG
Thank you for teaching.
I will ask my friend on which conference he wants to get a proceeding.
∂18-Dec-84 2045 ELLIOTT%SLACVM.BITNET@Berkeley BITNET mail follows
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 18 Dec 84 20:45:07 PST
Received: from ucbjade.CC.Berkeley.ARPA (ucbjade.ARPA) by UCB-VAX.ARPA (4.24/4.40)
id AA15275; Tue, 18 Dec 84 20:45:48 pst
Received: from ELLIOTT@SLACVM.BITNET
by ucbjade.CC.Berkeley.ARPA (4.19/4.31)
id AA28169; Tue, 18 Dec 84 20:45:48 pst
Message-Id: <8412190445.AA28169@ucbjade.CC.Berkeley.ARPA>
Date: 18 December 84 20:46-PST
From: ELLIOTT%SLACVM.BITNET@Berkeley
To: JMC@SU-AI
Subject: BITNET mail follows
Date: 18 December 1984, 20:32:14 PST
From: ELLIOTT at SLACVM
To: jmc at su-ai.arpa
Subject: testing 1 2 3 4
In-Reply-To: jmc at su-ai.arpa -- 12/18/84, 10:04
I hope this gets back, I am improvising.
∂18-Dec-84 2310 HST gwai85
the written paper should not be a very important problem.may i conclude
that you have some moderate interest to come?
∂18-Dec-84 2329 BOSACK@SU-SCORE.ARPA Re: mail to SLAC
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 18 Dec 84 23:28:25 PST
Date: Tue 18 Dec 84 23:27:02-PST
From: Len Bosack <BOSACK@SU-SCORE.ARPA>
Subject: Re: mail to SLAC
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 18 Dec 84 21:04:00-PST
Did you get some indication that the mail actually got there?
-------
∂19-Dec-84 0201 LLW@S1-A.ARPA Clearances and PSQs
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 19 Dec 84 02:00:58 PST
Date: 19 Dec 84 0200 PST
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: Clearances and PSQs
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA
∂18-Dec-84 1354 JMC@SU-AI.ARPA Clearance delays
Received: from SU-AI.ARPA by S1-A.ARPA with TCP; 18 Dec 84 13:54:07 PST
Date: 18 Dec 84 1347 PST
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: Clearance delays
To: llw@S1-A.ARPA
It occurs to me that there might be an impasse of the following kind.
The PSQ asked only about organization memberships for the past ten
years, and that's what I gave them. On the other hand, the preliminary
questionnaire that I filled out when I became a summer employee several
years ago asked for memberships without time limit, and I gave them that.
All activities that they might consider relevant to a clearance are more
than ten years old, and there may be some law or regulation that inhibits
them from asking. I am entirely willing to waive such a restriction if
it exists and if they are allowed to accept such a waiver. Perhaps you
could ask the LLNL security people or the DOE people if there is such
a problem. Needless to say, I will be guided by your recommendation as
to the right strategy, but you don't know everything either.
[John: By telling the Security folks to go jump in the lake on their
latest PSQ demand, I was just trying to accommodate your plea for
reasonableness in the number and recent frequency of such demands. I
have asked for justification for the latest demand, and haven't yet
heard back. I'll keep you posted on whatever I find out, particularly
whether they really do need another one for some obscure reason. Lowell]
∂19-Dec-84 0807 RPG Burton Smith
To: CLT@SU-AI.ARPA, JJW@SU-AI.ARPA, JMC@SU-AI.ARPA,
cheriton@SU-PESCADERO.ARPA
He is (somewhat unexpectedly) in town today, visiting me at Lucid.
He had said he would try to make it this week, but that he would call
last week to set a time. He called yesterday and set today as the time.
In any event, he will be at Lucid at 11:30, and perhaps some of you would like
to come by and chat with him. If you cannot, my guys and I will talk to
him about the Lisp woes on the machine.
-rpg-
∂19-Dec-84 0852 RINDFLEISCH@SUMEX-AIM.ARPA Re: AI and Supercomputing
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 19 Dec 84 08:52:23 PST
Date: Wed 19 Dec 84 08:52:19-PST
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: Re: AI and Supercomputing
To: L.LANSDALE%LOTS-A@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA, nilsson@SRI-AI.ARPA,
zm@SU-AI.ARPA, golub@SU-NAVAJO.ARPA, wiederhold@SUMEX-AIM.ARPA
cc: s.street%LOTS-A@SUMEX-AIM.ARPA, Rindfleisch@SUMEX-AIM.ARPA,
Feigenbaum@SUMEX-AIM.ARPA, Nii@SUMEX-AIM.ARPA, Brown@SUMEX-AIM.ARPA,
Delagi@SUMEX-AIM.ARPA, RPG@SU-AI.ARPA
In-Reply-To: Message from "Susan Lansdale <L.LANSDALE@LOTS-A>" of Tue 11 Dec 84 09:02:56-PST
Thanks for your message, Susan. The HPP has a strong interest in concurrent
computing for AI but has no spare resources to help organize such a workshop.
Also, I don't recall seeing any draft of what "Stanford" said its involvement
in the SDSC proposal would be -- is there something you could send me? Is
there a proposed set of topics like "how would AI folks do it on a CRAY"?
Right now the Cray does not look like a very good Lisp engine that would help
AI and we are looking at other architectures for some sort of local facility.
Tom R.
-------
∂19-Dec-84 0900 JMC*
postpone dentist
∂19-Dec-84 1218 TAJNAI@SU-SCORE.ARPA EG&G
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Dec 84 12:18:03 PST
Date: Wed 19 Dec 84 12:16:07-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: EG&G
To: jmc@SU-AI.ARPA
Shall I give EG&G to HPP? or are you interested?
-------
∂19-Dec-84 1324 RA
∂18-Dec-84 1628 JMC catalog pages to John Williams
Please mail John Williams at IBM a copy of the pages in the Stanford
catalog giving the industry lecture courses for this year. The
K, etc. in the PHON entry speeds up deliver within IBM.
-------------
I don't know what you mean by "industry lecture courses", something like this
is not listed in the catalog. Shall I send him the pages relating to the
computer science department?
Is he @ IBM San Jose?
∂19-Dec-84 1325 RA
Your daughter Suzan returned your call.
∂19-Dec-84 1336 Allen.PA@Xerox.ARPA Kurzweil Machine
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 19 Dec 84 13:36:21 PST
Received: from Cabernet.MS by ArpaGateway.ms ; 19 DEC 84 13:35:47 PST
Date: 19 Dec 84 13:40:32 PST (Wednesday)
From: Allen.PA@XEROX.ARPA
Subject: Kurzweil Machine
To: McCarthy@SU-AI.ARPA
cc: Allen.PA@XEROX.ARPA, Spencer.PA@XEROX.ARPA
John,
There is an outside chance Xerox could supply a Kurzweil machine to you,
the CS Department and Stanford. Could you send me a brief, one-page note
on what your (collective) interests would be and what reserch might be
forthcoming.
Happy Holidays
Bill
∂19-Dec-84 1339 PACK@SU-SCORE.ARPA [Marianne Winslett <WINSLETT@SU-SCORE.ARPA>: [jbn@FORD-WDL1.ARPA: Re: industrial lectureships]]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Dec 84 13:39:34 PST
Date: Wed 19 Dec 84 13:38:13-PST
From: Leslie Kaelbling <PACK@SU-SCORE.ARPA>
Subject: [Marianne Winslett <WINSLETT@SU-SCORE.ARPA>: [jbn@FORD-WDL1.ARPA: Re: industrial lectureships]]
To: jmc@SU-AI.ARPA
Should we take it upon ourselves to try to invite people, or have
enough people responded to the request for applications?
- Leslie
---------------
Mail-From: WINSLETT created at 18-Dec-84 16:12:27
Date: Tue 18 Dec 84 16:12:27-PST
From: Marianne Winslett <WINSLETT@SU-SCORE.ARPA>
Subject: [jbn@FORD-WDL1.ARPA: Re: industrial lectureships]
To: pack@SU-SCORE.ARPA
Did I send you this already? Nagle wants to see more industrial
and less researchy people taking the industrial lectureships. Certainly
lots of people (not PhD students) are interested in that kind
of stuff.
--Marianne
---------------
Return-Path: <jbn@FORD-WDL1>
Received: from FORD-WDL1 by SU-SCORE.ARPA with TCP; Tue 20 Nov 84 14:22:26-PST
Return-Path:<>
Date: 20-Nov-84 14:23:30-PST
From: jbn@FORD-WDL1.ARPA
Subject: Re: industrial lectureships
To: Winslett@SU-SCORE.ARPA
Cc: jbn@FORD-WDL1.ARPA
There are people who might be willing to do it if asked, but would never
apply to do so. Most of them have startup companies. One possibility is
Dr. Richard Sherman, from here (Ford Aerospace and Communications Corp.)
He has several patents in the local networking area, covering both such
things as CSMA-CD backoff algorithms and a way to plug into a coax cable
that works better than a vampire tap.
John Nagle
-------
-------
∂19-Dec-84 1353 AI.WOODY@MCC.ARPA Re: visit
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 19 Dec 84 13:52:53 PST
Date: Wed 19 Dec 84 15:52:50-CST
From: Woody Bledsoe <AI.Woody@MCC.ARPA>
Subject: Re: visit
To: JMC@SU-AI.ARPA
cc: AI.Woody@MCC.ARPA, ai.martin@MCC.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 19 Dec 84 02:22:00-CST
John,
I will meet you at your flight Thursday evening; then we go to Doug
Lenat's and Mary's for dinner. If not OK let me know.
You are scheduled
Bob Inman (and me) at 9:00
Your talk on Non-monotonic Logic at 10:00
Please say a few words about QLAMBDA also.
The rest is open ended and informal. Dick Martin and few others
would like to go with you to dinner Friday night (including
Bob Boyer, I believe).
Woody
-------
∂19-Dec-84 1407 SJG astronaut stats
applied: 4934
qualified: 3584
interviewed: 128
accepted: 17
Matt
∂19-Dec-84 1603 RA Topics drawer
The last page in peopin[1,jmc] lists the files in the TOPICS drawer.
∂19-Dec-84 1614 TAJNAI@SU-SCORE.ARPA Re: dithering about EG&G
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Dec 84 16:14:20 PST
Date: Wed 19 Dec 84 16:13:02-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: Re: dithering about EG&G
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 19 Dec 84 16:10:00-PST
Ok, John. They aren't holding their breath, but you are their first
choice. I would be happy to have you more active in the Forum.
But no pressure.
Merry Christmas to you and Carolyn,
Carolyn
-------
∂19-Dec-84 2243 pratt@Navajo Industrial Lecturer
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 19 Dec 84 22:43:40 PST
Date: Wed, 19 Dec 84 22:42:32 pst
From: Vaughan Pratt <pratt@Navajo>
Subject: Industrial Lecturer
To: jmc@sail
Have you located an industrial lecturer yet? If not, Sun's Eric Schmidt might
be just the guy for you. He features:
* Ph.D. from Berkeley, on work done during his employment at Xerox, where
he worked on engineering large software systems.
* Currently Director of Software at Sun. (The Sun hierarchy goes
VP/Director/Manager/Staff; there are 12 directors out of 700+ employees.)
* Has expressed to me an interest in occasional teaching at Stanford.
* Is professorial both in breeding (father was an economics prof. somewhere
in Virginia) and manner (disconcertingly so).
I would expect his teaching style to be somewhat dry but very organized.
-v
∂20-Dec-84 0900 JMC*
cleaning
∂20-Dec-84 0925 L.LANSDALE@[36.48.0.1] Re: AI and Supercomputing
Received: from LOTS-A by SU-AI.ARPA with TCP; 20 Dec 84 09:25:14 PST
Date: Thu 20 Dec 84 09:26:26-PST
From: Susan Lansdale <L.LANSDALE@[36.48.0.1]>
Subject: Re: AI and Supercomputing
To: Rindfleisch%SUMEX-AIM@[36.48.0.1]
cc: jmc@SU-AI.ARPA, nilsson@SRI-AI.ARPA, zm@SU-AI.ARPA, golub@SU-NAVAJO.ARPA,
wiederhold%SUMEX-AIM@[36.48.0.1], s.street@[36.48.0.1],
Feigenbaum%SUMEX-AIM@[36.48.0.1], Nii%SUMEX-AIM@[36.48.0.1],
Brown%SUMEX-AIM@[36.48.0.1], Delagi%SUMEX-AIM@[36.48.0.1], RPG@SU-AI.ARPA
In-Reply-To: Message from "T. C. Rindfleisch <Rindfleisch@SUMEX-AIM>" of Wed 19 Dec 84 08:53:59-PST
Dear Tom, I will be happy to forward to you (attached to this
message) the original memo and questionnaire sent out to the
research community regarding our participation in the SDSC. It
looks like it is going to fly, as a matter of fact, and Bob
Street and I will be flying down to San Diego for a Steering
Committee meeting to discuss the particulars on the 8th of
January.
Ed Feigenbaum has also called in response to the possible AI
workshop with similar questions. I recently spoke to Dan Bender,
our contact with GA Technologies, the company organizing all of
this. He was visualizing the following scenario: application for
funding from NSF to offset organizational costs--
GA Technologies shouldering much of the organizational burden: work to get
the funding, put out publicity, make arrangements for room and board--
Stanford would provide "prestige and guidance", which I presume means
presenting papers, helping to screen papers and set agenda.
Topics suggested by Bender include addressing how to use
supercomputers in AI, what the requirements are, what has been
done, where supercomputing and AI are going, what are potential
projects, what are the needs of the AI community regarding the
sort of computationally intensive work which supercomputers can do.
Shall we try to get together with Ed and/or some of his group to discuss this?
At this point, the whole thing is very open-ended.
Susan
November 1, 1984
To All Interested Parties
Robert L. Street, Vice Provost
Academic Computing Systems
San Diego Supercomputer Center
Colleagues,
I am pleased to announce Stanford's recent decision to
participate in a proposal supporting the creation of the San Diego
Supercomputer Center (SDSC). With funds from the National Science
Foundation (NSF), this Center would seek to provide advanced
computing capability to the academic research community nationwide.
Stanford joins seventeen other distinguished academic and research
institutions and GA Technologies in this proposal which, we
believe, will prove of enormous benefit to those in our research
community who could make use of the power of the supercomputer.
We expect an answer from NSF in March of 1985. We are coming to you
now to explore the real interest on campus in such availability of
supercomputer resources and to build up a database regarding the
kinds of uses to which Stanford's research community would put these
resources.
The SDSC central facility would be located on the campus of the
University of California at San Diego and administered by GA
Technologies. With its full time staff of 62, GA would also
provide training, consulting, education and documentation. The
enhanced hardware configuration for the Center would be composed of
a Cray X-MP/48 supercomputer with four processors and eight million
words of memory, a large hierarchical file storage system, extensive
interactive graphics and graphics output facilities, and an advanced
array processor. The operating system for the supercomputer is
expected to be the highly interactive Cray timesharing system (CTSS)
with its extensive debugging, editing, and supporting software
tools-- a system familiar to many at Stanford.
Access to the central supercomputing facilities would be provided
by high-speed communications links, possibly via satellite, from
VAX- based Remote User Access Centers at each participating
institution. Stanford is in the process now of constructing SUNet,
the wide baseband and broadband communications network. We expect
that, under ACIS Networking Systems, our SDSC Remote User Access
Center would be integrated into SUNet and thereby become easily
available to the entire Stanford community, The SDSC would provide
hardware and software. Stanford would be committed to providing a
site, staffing, user support, and hardware and software maintenance.
In exchange for participation in the SDSC consortium, Stanford
would be able to offer to its research community a sizeable amount
of Cray X-MP time yearly. It is planned that the only cost to the
research community will be for Stanford's expenses related to site,
staffing, user support, and maintenance of the Remote User Access
Center. In planning towards most efficiently allocating and
configuring our supercomputer resources, your responses to the
attached questionnaire would be most helpful. We hope to understand
from you what your needs are, the sorts of problems you would like
to run, the types of data you use, and what software you need.
Please feel free to contact me at s.street@lots-a, or Susan Lansdale
at l.lansdale@lots-a, or 7-9222. We look forward to your
response.
Best regards,
Robert Street
Vice Provost for Academic Computing
and Information Systems
Attachments: Appendix A & B
.pa
APPENDIX A
Member Institutions of the San Diego
Supercomputer Center Consortium
Agouron Institute
California Institute of Technology
National Optical Astronomy Observatories (Kitt Peak National
Observatory)
Research Institute of Scripps Clinic
Salk Institute for Biological Studies
San Diego State University
Southwest Fisheries Center
Stanford University
University of California at Los Angeles
University of California at San Diego
University of California at San Diego - Scripps Institution of
Oceanography
University of California at San Francisco
University of Hawaii
University of Maryland
University of Michigan
University of Utah
University of Washington
University of Wisconsin
.pa
APPENDIX B
Appendix B
Questionnaire
Name: Phone:
Department:
1. Research Interests:
2. Current supercomputer Use (type of computing, amount of time,
type of computer, etc.) if any:
3. Projected SDSC activity:
a. Estimated number of Cray X-MP hours per year: ←←←←
b. Types of computing: (graphics, numerical simulation)
c. Software needs:
d. Other:
4. In exchange for the system access and Cray X-MP hours would you
be able to pay a local access fee (e.g., per X-MP hour) to
defray the costs of the site preparation, operation staff and
maintenance of the Remote User Access Center?
←←←Yes
←←←No
If yes, please check the maximum amount which you would be
willing to pay per Cray hour used:
←←←$50
←←←$100
←←←$200
Please return this questionnaire to Susan Lansdale, Building 10, by
Friday, November 9, 1984.
Thank you.
-------
∂20-Dec-84 0942 RA cancelled check
I still need your cancelled check for the registration for the nonmonotonic
conference.
∂20-Dec-84 1023 RA
Dick Gabriel wanted to let you know he is on his way. You have a 10:00
meeting with him.
∂20-Dec-84 1049 RA
Barbara from McMillan Publishing Co. (212) 702 5639 would like you to call
her re doing a review.
∂20-Dec-84 1143 HENJUM@SU-SCORE.ARPA re: Answer (from SAIL's BBOARD)
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Dec 84 11:43:11 PST
Date: Thu 20 Dec 84 11:42:10-PST
From: Olaf Henjum <HENJUM@SU-SCORE.ARPA>
Subject: re: Answer (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 19 Dec 84 21:21:00-PST
Doesn't anyone have anything more interesting to discuss on the (public)
bboards than speeding? (I confess I don't, but I haven't seen this kind of
flamage on ONE topic since the election.)
My two cents worth... until we replace personal automobiles with personal
aircraft (complete with autopilots capable of avoiding collisions), speeding
is likely to be a problem, but by then we'll probably have more interesting
transportation problems to worry about (picture a 3-D traffic intersection!).
Assuming, of course, the human race survives that long...
As for putting up untruths or half-truths on bboard, so what else is new??
Merry Christmas, all, and a relatively sane Winter quarter to follow.
(I can dream, can't I?)
-------
∂20-Dec-84 1145 HENJUM@SU-SCORE.ARPA Excuse the previous msg...
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Dec 84 11:45:17 PST
Date: Thu 20 Dec 84 11:43:19-PST
From: Olaf Henjum <HENJUM@SU-SCORE.ARPA>
Subject: Excuse the previous msg...
To: jmc@SU-AI.ARPA
...it was supposed to go to the score bboard. Merry Christmas, anyway.
-------
∂20-Dec-84 1518 fateman%ucbdali@Berkeley meeting about parallel lisp dialects
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 20 Dec 84 15:18:41 PST
Received: from ucbdali.ARPA by UCB-VAX.ARPA (4.24/4.40)
id AA07758; Thu, 20 Dec 84 15:11:36 pst
Received: by ucbdali.ARPA (4.24/4.40)
id AA06338; Thu, 20 Dec 84 15:19:07 pst
Date: Thu, 20 Dec 84 15:19:07 pst
From: fateman%ucbdali@Berkeley (Richard Fateman)
Message-Id: <8412202319.AA06338@ucbdali.ARPA>
To: hilfingr%ucbdali@Berkeley, larus%kim@Berkeley, ouster%ucbdali@Berkeley,
pattrsn%ucbdali@Berkeley, randy%ucbdali@Berkeley, zorn%kim@Berkeley
Subject: meeting about parallel lisp dialects
Cc: clt@su-ai, fateman%ucbdali@Berkeley, jmc@su-ai, rpg@su-ai
There seem to be several projects to produce lisp systems for
existing or to-be-constructed computers. John McCarthy, Carolyn Talcott,
(Stanford) and Richard Gabriel (Lucid Inc) and I are considering
a cooperative Stanford-UCB proposal to DARPA for implementation of
Q-lambda on an appropriate machine, and implementation in Q-lambda
of algebraic manipulation algorithms. Since the implementation
of a common-lisp dialect supporting parallel computation is also a
component of SPUR, it would seem like a good thing to (at least)
know more about what each group is proposing; (at most?) to merge
some of the effort, and (for the future?) have a larger meeting bringing
in people at BBN, MIT, and other places with an interest in parallel
Lisp.
A meeting has been proposed for the afternoon/evening of Jan. 9, in
Berkeley. If you can attend, please send me mail ASAP. If you
cannot attend at that time, please suggest a choice of alternative
times.
(If you feel you need not attend, please say so, too.)
∂21-Dec-84 0944 RPG Sequent
To: CLT, JJW, JMC
Their manuals arrived today.
-rpg-
∂21-Dec-84 1002 YM Example where unification buys you more:
To: JMC@SU-AI.ARPA, ZM@SU-AI.ARPA, RJW@SU-AI.ARPA
The problem:
Transoform a tree such that the output tree will have the same shape as the
input tree but all the tips (leaves) will have the value g(t1,t2,...,tn)
where g is an associative function and t1,...,tn are the tips of the original
tree.
Solution in Tablog (where g is taken to be min, ⊗ is the tree constructor,
transform and tt are functions and the other symbols are variables):
Transform(Old)=TT(Old,M,M).
TT(L⊗R,F,min(M1,M2)) = TT(L,F,M1)⊗TT(R,F,M2).
TT(N,M,N)=M.
This solution depends on the order of the assertions.
If we add the predicate ATOM to the langauge we can rewrite it as:
Transform(Old)=TT(Old,M,M).
TT(L⊗R,F,min(m1,m2)) = TT(L,f,m1)⊗TT(R,f,m2).
TT(N,M,N)=M :- atom(N).
Which doesn't depend on the order of the assertions.
Using a different representation of trees:
Transform(Old)=TT(Old,M,M).
TT(Leaf(N),M,N)=Leaf(M).
TT(Tree(L,R),f,min(m1,m2)) = Tree(TT(L,f,m1),TT(R,f,m2)).
It seems that you need a two-pass program if you use Lisp.
Any Comments?
Thanks,
Yoni.
∂21-Dec-84 1132 SHAHN@SUMEX-AIM.ARPA Something seen in Human-Nets
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 21 Dec 84 11:31:56 PST
Date: Fri 21 Dec 84 11:33:46-PST
From: Sam Hahn <SHahn@SUMEX-AIM.ARPA>
Subject: Something seen in Human-Nets
To: jmc@SU-AI.ARPA
I found this in the above-mentioned digest. Maybe you would be
curious...
Message 8 -- ************************
21-Dec-84 00:22:00-PST,12720;000000000000
Return-Path: <MCGREW@RUTGERS.ARPA>
Received: from RUTGERS.ARPA by SUMEX-AIM.ARPA with TCP; Fri 21 Dec 84 00:21:03-PST
Date: 21 Dec 84 0128-EST
From: Charles McGrew (The Moderator) <Human-Nets-Request@Rutgers>
Reply-to: HUMAN-NETS@RUTGERS
Subject: HUMAN-NETS Digest V7 #84
To: HUMAN-NETS@RUTGERS
HUMAN-NETS Digest Friday, 21 Dec 1984 Volume 7 : Issue 84
[Ed. Note: Happy Christmas!]
Today's Topics:
Computers and People - "Snagging" your Phone Line &
"Idea Processors" (3 msgs) &
CDs vs books,
Information - Papers on 'Programming in the Large'
----------------------------------------------------------------------
<... lots of messages left out...>
From: ihnp4!utzoo!henry@Berkeley
Date: 18 Dec 84 13:03:55 CST (Tue)
To: POURNE@MIT-MC.ARPA
Subject: Re: Personal Assistants -- a skeptical viewpoint
[....]
What I do dislike is sales hype, or the equivalent, which claims that
innovation X is going to bring about Nirvana here on Earth in just a
few years. I.e., Real Soon Now. (Yes, I read and enjoy your column
in Byte.) In particular, the next time somebody tells me that applied
AI and/or the Fifth Generation is going to solve all my problems, I
think I'm gonna throw up. The AI folks are notorious for exuberant
promises followed by failure and disillusionment. I would have
thought they, of all people, would be a bit more cautious about
predicting the Millenium yet again. Nope, same old snake oil...
What I should have made clearer, in my earlier note, was that I do
expect some very interesting byproducts from the inevitable failures.
I have no quarrel with anyone who merely predicts significant advances
and the appearance of useful new tools. This cloud is indeed likely
to have a silver lining, even though it's not going to be solid
platinum as its proponents claim.
Henry Spencer @ U of Toronto Zoology
{allegra,ihnp4,linus,decvax}!utzoo!henry
------------------------------
Date: 20 December 1984 00:46-EST
From: Jerry E. Pournelle <POURNE @ MIT-MC>
Subject: Personal Assistants -- a skeptical viewpoint
To: ihnp4!utzoo!henry @ UCB-VAX
Ah well, I suppose I must agree regarding the hype.
As to AI: there is a famous story.
John McCarthy some years ago is said to have bought a Heathkit
television for the Stanford AI lab. When it arrived a student
eagerly fell upon it, but was restrained.
"We will construct a robot to build the kit," McCarthy
is said to have said.
Last I heard the box was unopened.
The story is probably apochryphal][sp?] but I do recall
the Great Foreign Language Translation Revolution predicted in
the 60's...
-------
∂22-Dec-84 1856 ATP.BLEDSOE@UTEXAS-20.ARPA Times for another visit
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 22 Dec 84 18:56:22 PST
Date: Sat 22 Dec 84 20:55:37-CST
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Times for another visit
To: jmc@SU-AI.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
John,
I am pretty tied up through most of January, but seem to be free
All of February starting with Feb 4, at least all of the Mondays and
Fridays. We are in the process of scheduling Tom Mitchell and some
others but have not done so yet.
I hope you can come. When you come we should probably concentrate
on some of the theorem proving ideas that we were talking about, and
keep mostly to ourselves, so that we can have more time on it.
(Though you will want to talk with Doug Lenat about his project.). Also
it might be good to extend your visit to a couple of days if you can,
maybe Friday and Saturday, if we both have Saturday free.
Why don't you suggest a time.
Best Regards,
Woody
-------
∂23-Dec-84 1203 VAL paper on prioritized circumscription
I finished a paper which extends the methods for expressing circumscription by
first order formulas from my workshop paper to a rather general case of
prioritized circumscription. The methods are illustrated by an example with
five kinds of abnormality and three priority levels. I left a copy of the paper
in your mailbox. If you'd like me to tell you about the paper (rather than read
it), I'll be glad to do that any time.
Merry Christmas and happy 1985,
Vladimir
∂23-Dec-84 2000 JMC*
Sarah
∂23-Dec-84 2100 JMC*
Phone Les.
∂24-Dec-84 0900 JMC*
Marc LeBrun about Macsyma
∂24-Dec-84 0900 JMC*
Woody about ICM and David
∂24-Dec-84 0900 JMC*
oil for motor
∂24-Dec-84 1310 CLT project q
i would like to look at the synapse proposal and the lucid proposal
when they are available
∂24-Dec-84 1322 ME info
∂24-Dec-84 1320 JMC former Gabriel large monitor
I have move it to Art Samuel's office. He was finding the character size
of the regular monitor too small.
ME - OK, thanks for the info.
∂24-Dec-84 1604 vardi@diablo Thanks
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 24 Dec 84 16:04:42 PST
Date: Mon, 24 Dec 84 16:06:51 pst
From: Moshe Vardi <vardi@diablo>
Subject: Thanks
To: JMC@Sail
Moshe
∂24-Dec-84 2124 CLT reference
can you fill in the missing reference (??) below
McCarthy (\bibref{??}) introduced the phrase ``mathematical theory of computation''
as a name for the study of proving correctness assertions about computer
programs.
∂24-Dec-84 2233 POURNE@MIT-MC Pournelle's story
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 24 Dec 84 22:33:31 PST
Date: 25 December 1984 01:34-EST
From: Jerry E. Pournelle <POURNE @ MIT-MC>
Subject: Pournelle's story
To: JMC @ SU-AI
In-reply-to: Msg of 23 Dec 84 1056 PST from John McCarthy <JMC at SU-AI.ARPA>
Alas. Well, with your permission I will continue; it sounds
better my way. With your embellishments. Reward, huh? Maybe
we can generate one...
Jerry
∂26-Dec-84 0900 JMC*
Symbolics 494-8081
∂26-Dec-84 0900 JMC*
Data General 856-6060.
Digital Deli 961-2670, 80 west El Camino 94040
∂26-Dec-84 0858 RPG Sequent
To: JMC@SU-AI.ARPA, CLT@SU-AI.ARPA, LES@SU-AI.ARPA, JJW@SU-AI.ARPA,
cheriton@SU-PESCADERO.ARPA
They want to visit us monday, Jan 7 at 2pm at Stanford. They said that
Dave Rogers will probably come - he is the hardware designer. I have their
manual. Can y'all come then?
-rpg-
∂26-Dec-84 1353 ATP.BLEDSOE@UTEXAS-20.ARPA re: Times for another visit
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 26 Dec 84 13:52:59 PST
Date: Wed 26 Dec 84 15:52:10-CST
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: re: Times for another visit
To: JMC@SU-AI.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 22 Dec 84 20:36:00-CST
John, Feb 15-16 are fine with me.
I will include Charles Petrie in this since he is much interested in
non-monotonic reasoning. Also I hope that he can help us develop some
sizable exambles for testing out implementation ideas.
-------
∂26-Dec-84 1806 JK
I am planning on coming in tomorrow (thursday), in the late afternoon.
∂27-Dec-84 0941 RA
A check from Inference on your desk. Does Stanford get charged for your trip
to Texas? If not, who does. What was the purpose of the trip.
∂27-Dec-84 1111 RA
Donald Liou would like to talk to you re applying for Stanford. When will be
a good time to come and see you. He lives in Walnut Creek and therefore cannot
just drop by. Let me know and I'll call him.
∂27-Dec-84 1326 CLT mtg with les
les suggest jan 2
i suggest 4ish
∂27-Dec-84 1354 AAAI@SRI-AI.ARPA elections
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 27 Dec 84 13:54:35 PST
Date: Thu 27 Dec 84 13:53:57-PST
From: name AAAI-OFFICE <AAAI@SRI-AI.ARPA>
Subject: elections
To: JMC@SU-AI.ARPA
cc: aaai@SRI-AI.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
I know this may be a bit premature, but our elections will
occur in May. We'll need to start to think (or, maybe you
already have) candidates for President-elect and 4 councilors.
LAst year, we had some complaints that there was one Presidential
candidate and would have preferred two candidates. Also,
they wanted vitas and some personal statement from
alll the candidates. MAybe we can at least get a vita from
all the candidates for inclusion into the ballot.
Cheers,
Claudia
-------
∂27-Dec-84 2000 JMC*
Sarah
∂28-Dec-84 0916 RA
Please call David Chudnovski @ (212) 650 2834. If you have troubele getting
the number ask the operator to help you. David claims this telephone is
flaky.
∂28-Dec-84 1417 RA
Marc LeBrun returned your call. He'll be back in his office Jan. 3.
His # 494 8081.
∂28-Dec-84 1528 RA
Happy new year to you and Carolyn
∂29-Dec-84 0600 NET-ORIGIN@MIT-MC Course. (Fifth mailing attempt).
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 29 Dec 84 05:59:57 PST
Received: from SPA-LOS-TRANCOS by SPA-RUSSIAN via CHAOS with CHAOS-MAIL id 73171; Fri 28-Dec-84 23:39:46-PST
Date: Fri, 28 Dec 84 23:39 PST
From: rwg%SPA-NIMBUS@NIMBUS.SPA.Symbolics
Sender: rwg@NIMBUS.SPA.Symbolics
Subject: Course. (Fifth mailing attempt).
To: jmc at SU-AI@MIT-MC.ARPA
Supersedes: <841226175615.1.RWG@LOS-TRANCOS.SPA.Symbolics>
Message-ID: <841228233951.7.RWG@LOS-TRANCOS.SPA.Symbolics>
Date: Monday, 10 December 1984, 20:02-PST
From: HIC at SWW-WHITE
Date: Monday, 10 December 1984, 18:41-EST
From: Postmaster at SCRC-QUABBIN
Unable to deliver letter to the following recipient:
jmc at SU-AI: Host not responding.
----- Text of letter follows -----
Received: from SWW-WHITE by SCRC-QUABBIN via CHAOS with CHAOS-MAIL id 110898; Fri 7-Dec-84 17:56:08-EST
Date: Fri, 7 Dec 84 14:57 PST
From: rwg%SWW-WHITE@SCRC-RIVERSIDE.ARPA
Sender: FILE-SERVER%SWW-WHITE@SCRC-RIVERSIDE.ARPA
Subject: course
To: jmc@SU-AI.ARPA
Cc: rwg%SWW-WHITE@SCRC-RIVERSIDE.ARPA
Yow! Sorry to have taken so long to discover your offer--I was down with
the flu midway through a cross-country auto trip. (Right now I am at
Symbolics Graphics, Westwood.)
Initial reaction: Intense conflict. I love to teach Macsyma,
etc., and I hate to be on a schedule. When I taught that rearrangement
calculus thing, I made no research progress at all (although one of the
students made a valuable contribution), and it really used me up.
So, if it won't mess you up very badly, I'd like to say thanks for
the consideration, and no thanks to the responsibilities of giving another
course. I am wedded to a life of asynchronous hedonism.
∂31-Dec-84 1047 CLT mtg
les will appear at 4:30pm on jan 2 unless told otherwise
thats fine with me, how about you?
i sent rpg a request for some sort of document by then
haven't heard anything so far
∂31-Dec-84 1108 CLT so what's the reply?!!!
∂31-Dec-84 1102 JMC re: mtg
[In reply to message rcvd 31-Dec-84 10:47-PT.]
∂31-Dec-84 1421 CLT may i borrow
>***Morris, Francis Lockwood\Correctness of translations of programming languages --
*an algebraic approach\SAIL - #AIM-174\Aug. 1972\mtc. (GEN)
∂31-Dec-84 1849 SMC
Yojimbo is on now, channel 26